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/up.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:51:17,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:51:17,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:51:17,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:51:17,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:51:17,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:51:17,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:51:17,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:51:17,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:51:17,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:51:17,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:51:17,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:51:17,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:51:17,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:51:17,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:51:17,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:51:17,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:51:17,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:51:17,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:51:17,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:51:17,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:51:17,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:51:17,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:51:17,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:51:17,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:51:17,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:51:17,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:51:17,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:51:17,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:51:17,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:51:17,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:51:17,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:51:17,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:51:17,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:51:17,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:51:17,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:51:17,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:51:17,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:51:17,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:51:17,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:51:17,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:51:17,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:51:17,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:51:17,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:51:17,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:51:17,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:51:17,436 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:51:17,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:51:17,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:51:17,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:51:17,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:51:17,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:51:17,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:51:17,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:51:17,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:51:17,438 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:51:17,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:51:17,439 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:51:17,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:51:17,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:51:17,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:51:17,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:51:17,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:51:17,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:51:17,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:51:17,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:51:17,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:51:17,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:51:17,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:51:17,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:51:17,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:51:17,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:51:17,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:51:17,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:51:17,485 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:51:17,485 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:51:17,486 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/up.i [2019-09-03 19:51:17,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5994aad/bc36e5769ee14a8bb6f7da8491b55008/FLAGc59a16920 [2019-09-03 19:51:17,957 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:51:17,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/up.i [2019-09-03 19:51:17,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5994aad/bc36e5769ee14a8bb6f7da8491b55008/FLAGc59a16920 [2019-09-03 19:51:18,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5994aad/bc36e5769ee14a8bb6f7da8491b55008 [2019-09-03 19:51:18,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:51:18,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:51:18,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:51:18,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:51:18,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:51:18,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593235c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18, skipping insertion in model container [2019-09-03 19:51:18,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,385 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:51:18,405 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:51:18,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:51:18,621 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:51:18,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:51:18,658 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:51:18,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18 WrapperNode [2019-09-03 19:51:18,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:51:18,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:51:18,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:51:18,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:51:18,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (1/1) ... [2019-09-03 19:51:18,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:51:18,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:51:18,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:51:18,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:51:18,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:51:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:51:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:51:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:51:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:51:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:51:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:51:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:51:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:51:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:51:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:51:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:51:19,021 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:51:19,021 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:51:19,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:51:19 BoogieIcfgContainer [2019-09-03 19:51:19,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:51:19,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:51:19,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:51:19,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:51:19,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:51:18" (1/3) ... [2019-09-03 19:51:19,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137e956b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:51:19, skipping insertion in model container [2019-09-03 19:51:19,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:51:18" (2/3) ... [2019-09-03 19:51:19,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137e956b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:51:19, skipping insertion in model container [2019-09-03 19:51:19,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:51:19" (3/3) ... [2019-09-03 19:51:19,030 INFO L109 eAbstractionObserver]: Analyzing ICFG up.i [2019-09-03 19:51:19,040 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:51:19,047 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:51:19,077 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:51:19,131 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:51:19,132 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:51:19,132 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:51:19,133 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:51:19,133 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:51:19,133 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:51:19,133 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:51:19,133 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:51:19,134 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:51:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-03 19:51:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:51:19,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:19,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:19,165 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:19,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -634347879, now seen corresponding path program 1 times [2019-09-03 19:51:19,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:19,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:19,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:19,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:51:19,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:51:19,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:51:19,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:51:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:51:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:51:19,382 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-03 19:51:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:19,455 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2019-09-03 19:51:19,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:51:19,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 19:51:19,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:19,467 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:51:19,467 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:51:19,471 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-03 19:51:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:51:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:51:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:51:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 19:51:19,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-03 19:51:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:19,507 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 19:51:19,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:51:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 19:51:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:51:19,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:19,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:19,508 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash -306885048, now seen corresponding path program 1 times [2019-09-03 19:51:19,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:19,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:19,566 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-03 19:51:19,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:51:19,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:51:19,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:51:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:51:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:51:19,569 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-03 19:51:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:19,622 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-03 19:51:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:51:19,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-09-03 19:51:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:19,626 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:51:19,626 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:51:19,627 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-03 19:51:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:51:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-09-03 19:51:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:51:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-03 19:51:19,639 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-09-03 19:51:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:19,639 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-03 19:51:19,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:51:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-03 19:51:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:51:19,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:19,641 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:19,642 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:19,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:19,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1036343866, now seen corresponding path program 1 times [2019-09-03 19:51:19,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:19,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:19,734 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-03 19:51:19,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:19,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:19,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:19,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:51:19,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:19,845 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-03 19:51:19,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:19,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-03 19:51:19,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:51:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:51:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:51:19,853 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-09-03 19:51:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:19,965 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-09-03 19:51:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:51:19,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 19:51:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:19,969 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:51:19,970 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:51:19,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:51:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:51:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 19:51:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:51:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-03 19:51:19,982 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-09-03 19:51:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:19,984 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-03 19:51:19,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:51:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-03 19:51:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:51:19,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:19,986 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:19,986 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:19,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:19,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1343034647, now seen corresponding path program 2 times [2019-09-03 19:51:19,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:19,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:19,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:19,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:19,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:20,091 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-03 19:51:20,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:20,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:20,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:20,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:20,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:20,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:51:20,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:20,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:20,159 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-03 19:51:20,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:20,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-03 19:51:20,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:51:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:51:20,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:51:20,165 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-09-03 19:51:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:20,232 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-03 19:51:20,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:51:20,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-09-03 19:51:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:20,234 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:51:20,234 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:51:20,234 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-03 19:51:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:51:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-09-03 19:51:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:51:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-03 19:51:20,243 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2019-09-03 19:51:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:20,243 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-03 19:51:20,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:51:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-03 19:51:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:51:20,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:20,245 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:20,245 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:20,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2027779705, now seen corresponding path program 3 times [2019-09-03 19:51:20,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:20,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:20,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:20,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:20,378 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-03 19:51:20,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:20,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:20,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:20,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:51:20,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:20,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:51:20,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:20,471 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-03 19:51:20,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:20,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-09-03 19:51:20,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:51:20,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:51:20,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:51:20,478 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-03 19:51:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:20,586 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-03 19:51:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:51:20,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-03 19:51:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:20,588 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:51:20,588 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:51:20,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:51:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:51:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 19:51:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:51:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-09-03 19:51:20,595 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2019-09-03 19:51:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:20,596 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-09-03 19:51:20,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:51:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-09-03 19:51:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:51:20,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:20,597 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:20,598 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1195567144, now seen corresponding path program 4 times [2019-09-03 19:51:20,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:20,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:20,674 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-03 19:51:20,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:20,675 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-03 19:51:20,689 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-03 19:51:20,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:20,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:20,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:51:20,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:20,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:20,752 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-03 19:51:20,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:20,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-03 19:51:20,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:51:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:51:20,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:51:20,757 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2019-09-03 19:51:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:20,837 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-03 19:51:20,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:51:20,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-03 19:51:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:20,839 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:51:20,839 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:51:20,840 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-03 19:51:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:51:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-03 19:51:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:51:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-03 19:51:20,858 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2019-09-03 19:51:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:20,859 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-03 19:51:20,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:51:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-03 19:51:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:51:20,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:20,861 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:20,861 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash -193928102, now seen corresponding path program 5 times [2019-09-03 19:51:20,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:20,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:20,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:20,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:20,995 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-03 19:51:20,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:20,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:21,012 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:21,035 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:51:21,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:21,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:51:21,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:21,117 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-03 19:51:21,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:21,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2019-09-03 19:51:21,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:51:21,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:51:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:51:21,123 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 15 states. [2019-09-03 19:51:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:21,267 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-09-03 19:51:21,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:51:21,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-09-03 19:51:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:21,270 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:51:21,270 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:51:21,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:51:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:51:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 19:51:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:51:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-03 19:51:21,281 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2019-09-03 19:51:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:21,282 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-03 19:51:21,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:51:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-03 19:51:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:51:21,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:21,283 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:21,283 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 496842505, now seen corresponding path program 6 times [2019-09-03 19:51:21,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:21,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:21,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:21,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:21,363 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-03 19:51:21,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:21,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:21,380 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:21,402 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:51:21,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:21,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:21,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:21,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:21,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:21,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-03 19:51:21,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:51:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:51:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:51:21,441 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 11 states. [2019-09-03 19:51:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:21,537 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-03 19:51:21,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:51:21,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-03 19:51:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:21,538 INFO L225 Difference]: With dead ends: 53 [2019-09-03 19:51:21,539 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:51:21,539 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-03 19:51:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:51:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-09-03 19:51:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:51:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-03 19:51:21,546 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 37 [2019-09-03 19:51:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:21,546 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-03 19:51:21,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:51:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-03 19:51:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:51:21,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:21,548 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:21,548 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:21,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:21,549 INFO L82 PathProgramCache]: Analyzing trace with hash 225134169, now seen corresponding path program 7 times [2019-09-03 19:51:21,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:21,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:21,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:21,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:21,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:21,672 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-03 19:51:21,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:21,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:21,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:21,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:51:21,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:51:21,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:21,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2019-09-03 19:51:21,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:51:21,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:51:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:51:21,820 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 18 states. [2019-09-03 19:51:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:22,003 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-09-03 19:51:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:51:22,004 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-09-03 19:51:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:22,005 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:51:22,005 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:51:22,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:51:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:51:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 19:51:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:51:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-03 19:51:22,013 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2019-09-03 19:51:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:22,013 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-03 19:51:22,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:51:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-03 19:51:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:51:22,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:22,015 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:22,015 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1863484920, now seen corresponding path program 8 times [2019-09-03 19:51:22,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:22,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:22,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:22,132 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-03 19:51:22,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:22,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:51:22,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:22,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:22,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:22,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:22,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:22,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:22,218 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-03 19:51:22,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:22,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-09-03 19:51:22,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:51:22,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:51:22,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:51:22,222 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2019-09-03 19:51:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:22,291 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-03 19:51:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:51:22,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-09-03 19:51:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:22,292 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:51:22,292 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 19:51:22,293 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-03 19:51:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 19:51:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-09-03 19:51:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:51:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-03 19:51:22,300 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2019-09-03 19:51:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:22,300 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-03 19:51:22,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:51:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-03 19:51:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:51:22,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:22,301 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:22,302 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash -956795270, now seen corresponding path program 9 times [2019-09-03 19:51:22,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:22,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:22,457 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-03 19:51:22,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:22,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:22,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:22,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:51:22,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:22,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:51:22,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:22,684 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-03 19:51:22,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:22,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-09-03 19:51:22,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:51:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:51:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:51:22,693 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 21 states. [2019-09-03 19:51:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:22,937 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-09-03 19:51:22,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:51:22,937 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2019-09-03 19:51:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:22,938 INFO L225 Difference]: With dead ends: 82 [2019-09-03 19:51:22,938 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:51:22,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:51:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:51:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-03 19:51:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 19:51:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-09-03 19:51:22,947 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 52 [2019-09-03 19:51:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:22,947 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-09-03 19:51:22,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:51:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-09-03 19:51:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:51:22,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:22,949 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:22,949 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:22,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1520465111, now seen corresponding path program 10 times [2019-09-03 19:51:22,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:22,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:22,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:22,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:23,042 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-03 19:51:23,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:23,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:23,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:23,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:23,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:23,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:23,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:23,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:23,146 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-03 19:51:23,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:23,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-09-03 19:51:23,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:51:23,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:51:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:51:23,152 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2019-09-03 19:51:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:23,246 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-03 19:51:23,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:51:23,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-03 19:51:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:23,248 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:51:23,248 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:51:23,249 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-03 19:51:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:51:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-03 19:51:23,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:51:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-03 19:51:23,257 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 53 [2019-09-03 19:51:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:23,258 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-03 19:51:23,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:51:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-03 19:51:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:51:23,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:23,259 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:23,259 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:23,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:23,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2042098119, now seen corresponding path program 11 times [2019-09-03 19:51:23,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:23,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:23,411 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-03 19:51:23,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:23,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:23,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:23,490 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:51:23,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:23,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:51:23,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:23,668 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-03 19:51:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2019-09-03 19:51:23,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:51:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:51:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:51:23,674 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 24 states. [2019-09-03 19:51:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:23,932 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-09-03 19:51:23,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:51:23,933 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2019-09-03 19:51:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:23,934 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:51:23,934 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 19:51:23,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:51:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 19:51:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-03 19:51:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 19:51:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-03 19:51:23,943 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 60 [2019-09-03 19:51:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:23,943 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-03 19:51:23,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:51:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-03 19:51:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 19:51:23,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:23,945 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:23,945 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1054669848, now seen corresponding path program 12 times [2019-09-03 19:51:23,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:23,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:23,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:23,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:24,031 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-03 19:51:24,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:24,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:24,051 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-03 19:51:24,076 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:51:24,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:24,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:24,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:24,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:24,121 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-03 19:51:24,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-03 19:51:24,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:51:24,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:51:24,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:51:24,126 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 14 states. [2019-09-03 19:51:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:24,208 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-03 19:51:24,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:51:24,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-03 19:51:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:24,210 INFO L225 Difference]: With dead ends: 77 [2019-09-03 19:51:24,210 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 19:51:24,210 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-03 19:51:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 19:51:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-03 19:51:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 19:51:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-03 19:51:24,218 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 61 [2019-09-03 19:51:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:24,218 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-03 19:51:24,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:51:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-03 19:51:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:51:24,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:24,219 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:24,219 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1194201242, now seen corresponding path program 13 times [2019-09-03 19:51:24,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:24,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:24,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:24,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:24,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:24,391 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-03 19:51:24,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:24,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:24,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:24,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:51:24,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:24,654 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-03 19:51:24,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:24,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2019-09-03 19:51:24,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:51:24,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:51:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:51:24,662 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 27 states. [2019-09-03 19:51:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:24,982 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2019-09-03 19:51:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:51:24,982 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 68 [2019-09-03 19:51:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:24,983 INFO L225 Difference]: With dead ends: 104 [2019-09-03 19:51:24,983 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:51:24,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:51:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:51:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-03 19:51:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 19:51:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-03 19:51:24,993 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 68 [2019-09-03 19:51:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:24,993 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-03 19:51:24,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:51:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-03 19:51:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 19:51:24,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:24,996 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:24,997 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:24,997 INFO L82 PathProgramCache]: Analyzing trace with hash -519313591, now seen corresponding path program 14 times [2019-09-03 19:51:24,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:24,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:24,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:24,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:24,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:25,102 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-03 19:51:25,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:25,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:25,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:25,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:25,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:25,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:25,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:25,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:25,186 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-03 19:51:25,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:25,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-03 19:51:25,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:51:25,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:51:25,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:51:25,190 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2019-09-03 19:51:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:25,288 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-03 19:51:25,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:51:25,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-09-03 19:51:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:25,290 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:51:25,290 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 19:51:25,291 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-03 19:51:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 19:51:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-03 19:51:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:51:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-03 19:51:25,297 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2019-09-03 19:51:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:25,298 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-03 19:51:25,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:51:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-03 19:51:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 19:51:25,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:25,299 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:25,299 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash -111030759, now seen corresponding path program 15 times [2019-09-03 19:51:25,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:25,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:25,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:25,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:25,481 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-03 19:51:25,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:25,482 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-03 19:51:25,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:25,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:51:25,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:25,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:51:25,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:25,749 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-03 19:51:25,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:25,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2019-09-03 19:51:25,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:51:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:51:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:51:25,753 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 30 states. [2019-09-03 19:51:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:26,105 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-09-03 19:51:26,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:51:26,107 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 76 [2019-09-03 19:51:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:26,108 INFO L225 Difference]: With dead ends: 115 [2019-09-03 19:51:26,108 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:51:26,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:51:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:51:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-03 19:51:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 19:51:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-03 19:51:26,116 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 76 [2019-09-03 19:51:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:26,116 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-03 19:51:26,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:51:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-03 19:51:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 19:51:26,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:26,117 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:26,117 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash -170818104, now seen corresponding path program 16 times [2019-09-03 19:51:26,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:26,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:26,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:26,225 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-03 19:51:26,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:26,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:26,238 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:26,268 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:26,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:26,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:26,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:26,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:26,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:26,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2019-09-03 19:51:26,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:51:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:51:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:51:26,310 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 16 states. [2019-09-03 19:51:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:26,411 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-03 19:51:26,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:51:26,413 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-09-03 19:51:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:26,414 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:51:26,414 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 19:51:26,415 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-03 19:51:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 19:51:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-09-03 19:51:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 19:51:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-03 19:51:26,421 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 77 [2019-09-03 19:51:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:26,421 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-03 19:51:26,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:51:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-03 19:51:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:51:26,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:26,423 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:26,423 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:26,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1868804794, now seen corresponding path program 17 times [2019-09-03 19:51:26,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:26,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:26,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:26,639 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-03 19:51:26,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:26,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:26,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:26,684 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:51:26,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:26,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:51:26,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:26,927 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-03 19:51:26,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:26,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2019-09-03 19:51:26,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:51:26,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:51:26,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:51:26,932 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 33 states. [2019-09-03 19:51:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:27,349 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-09-03 19:51:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:51:27,349 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2019-09-03 19:51:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:27,350 INFO L225 Difference]: With dead ends: 126 [2019-09-03 19:51:27,350 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 19:51:27,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=472, Invalid=1420, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:51:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 19:51:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-03 19:51:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 19:51:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-03 19:51:27,358 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 84 [2019-09-03 19:51:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:27,359 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-03 19:51:27,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:51:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-03 19:51:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-03 19:51:27,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:27,360 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:27,360 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash -755741847, now seen corresponding path program 18 times [2019-09-03 19:51:27,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:27,472 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-03 19:51:27,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:27,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:27,514 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:51:27,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:27,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:51:27,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:27,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:27,546 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-03 19:51:27,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:27,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-03 19:51:27,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:51:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:51:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:51:27,550 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 17 states. [2019-09-03 19:51:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:27,697 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-09-03 19:51:27,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:51:27,697 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-03 19:51:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:27,698 INFO L225 Difference]: With dead ends: 101 [2019-09-03 19:51:27,698 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 19:51:27,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:51:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 19:51:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-09-03 19:51:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:51:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-09-03 19:51:27,705 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 85 [2019-09-03 19:51:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:27,706 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-09-03 19:51:27,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:51:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-09-03 19:51:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:51:27,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:27,707 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:27,707 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2077850119, now seen corresponding path program 19 times [2019-09-03 19:51:27,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:27,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:27,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:27,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:27,959 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-03 19:51:27,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:27,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:27,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:27,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:28,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:28,255 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-03 19:51:28,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:28,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2019-09-03 19:51:28,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:51:28,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:51:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:51:28,269 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 36 states. [2019-09-03 19:51:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:28,662 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2019-09-03 19:51:28,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:51:28,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 92 [2019-09-03 19:51:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:28,665 INFO L225 Difference]: With dead ends: 137 [2019-09-03 19:51:28,666 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 19:51:28,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=557, Invalid=1699, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:51:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 19:51:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-03 19:51:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 19:51:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-03 19:51:28,673 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2019-09-03 19:51:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:28,673 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-03 19:51:28,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:51:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-03 19:51:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 19:51:28,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:28,674 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:28,675 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1416036264, now seen corresponding path program 20 times [2019-09-03 19:51:28,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:28,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:28,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:28,818 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-03 19:51:28,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:28,818 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) [2019-09-03 19:51:28,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:28,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:28,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:28,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:51:28,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:28,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:28,938 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-03 19:51:28,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:28,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-09-03 19:51:28,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:51:28,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:51:28,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:51:28,944 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 18 states. [2019-09-03 19:51:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:29,096 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-09-03 19:51:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:51:29,097 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-03 19:51:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:29,098 INFO L225 Difference]: With dead ends: 109 [2019-09-03 19:51:29,098 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 19:51:29,098 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-03 19:51:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 19:51:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-09-03 19:51:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:51:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-09-03 19:51:29,104 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 93 [2019-09-03 19:51:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:29,105 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-09-03 19:51:29,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:51:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-09-03 19:51:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 19:51:29,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:29,106 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:29,106 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1033151270, now seen corresponding path program 21 times [2019-09-03 19:51:29,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:29,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:29,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:29,428 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-03 19:51:29,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:29,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:29,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:29,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:51:29,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:29,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:51:29,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:29,758 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-03 19:51:29,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:29,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 39 [2019-09-03 19:51:29,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:51:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:51:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:51:29,763 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2019-09-03 19:51:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:30,300 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2019-09-03 19:51:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:51:30,301 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2019-09-03 19:51:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:30,302 INFO L225 Difference]: With dead ends: 148 [2019-09-03 19:51:30,302 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 19:51:30,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=649, Invalid=2003, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:51:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 19:51:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-03 19:51:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 19:51:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-03 19:51:30,313 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 100 [2019-09-03 19:51:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:30,314 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-03 19:51:30,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:51:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-03 19:51:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-03 19:51:30,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:30,315 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:30,316 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash 99268489, now seen corresponding path program 22 times [2019-09-03 19:51:30,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:30,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:30,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:30,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:30,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:30,492 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-03 19:51:30,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:30,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:30,505 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-03 19:51:30,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:30,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:30,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:51:30,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:30,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:30,601 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-03 19:51:30,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:30,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-09-03 19:51:30,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:51:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:51:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:51:30,606 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 19 states. [2019-09-03 19:51:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:30,714 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-09-03 19:51:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:51:30,714 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-09-03 19:51:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:30,715 INFO L225 Difference]: With dead ends: 117 [2019-09-03 19:51:30,715 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 19:51:30,716 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-03 19:51:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 19:51:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-09-03 19:51:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:51:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-09-03 19:51:30,725 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 101 [2019-09-03 19:51:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:30,725 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-09-03 19:51:30,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:51:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-09-03 19:51:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 19:51:30,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:30,728 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:30,728 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash 730084825, now seen corresponding path program 23 times [2019-09-03 19:51:30,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:30,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:31,071 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-03 19:51:31,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:31,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:31,081 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:31,127 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:51:31,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:31,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:51:31,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:31,599 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-03 19:51:31,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:31,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 42 [2019-09-03 19:51:31,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:51:31,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:51:31,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:51:31,604 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 42 states. [2019-09-03 19:51:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:32,218 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-09-03 19:51:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:51:32,219 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 108 [2019-09-03 19:51:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:32,220 INFO L225 Difference]: With dead ends: 159 [2019-09-03 19:51:32,220 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 19:51:32,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2332, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:51:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 19:51:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-03 19:51:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 19:51:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-03 19:51:32,250 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 108 [2019-09-03 19:51:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:32,251 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-03 19:51:32,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:51:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-03 19:51:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-03 19:51:32,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:32,254 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:32,254 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash -372149880, now seen corresponding path program 24 times [2019-09-03 19:51:32,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:32,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:32,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:32,454 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-03 19:51:32,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:32,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:32,472 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:32,520 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:51:32,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:32,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:51:32,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:32,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:32,586 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-03 19:51:32,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:32,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-03 19:51:32,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:51:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:51:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:51:32,592 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 20 states. [2019-09-03 19:51:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:32,710 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2019-09-03 19:51:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:51:32,710 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-09-03 19:51:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:32,712 INFO L225 Difference]: With dead ends: 125 [2019-09-03 19:51:32,712 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 19:51:32,713 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-03 19:51:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 19:51:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-03 19:51:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 19:51:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-09-03 19:51:32,720 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 109 [2019-09-03 19:51:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:32,720 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-09-03 19:51:32,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:51:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-09-03 19:51:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 19:51:32,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:32,721 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:32,722 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:32,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1805061882, now seen corresponding path program 25 times [2019-09-03 19:51:32,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:32,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:32,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:32,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:32,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:33,044 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-03 19:51:33,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:33,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:51:33,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:33,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:51:33,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:33,447 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-03 19:51:33,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:33,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 45 [2019-09-03 19:51:33,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:51:33,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:51:33,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:51:33,452 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 45 states. [2019-09-03 19:51:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:34,119 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2019-09-03 19:51:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:51:34,119 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 116 [2019-09-03 19:51:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:34,121 INFO L225 Difference]: With dead ends: 170 [2019-09-03 19:51:34,121 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 19:51:34,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=854, Invalid=2686, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:51:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 19:51:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-03 19:51:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 19:51:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-03 19:51:34,131 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 116 [2019-09-03 19:51:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:34,131 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-03 19:51:34,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:51:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-03 19:51:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 19:51:34,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:34,132 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:34,133 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1388237911, now seen corresponding path program 26 times [2019-09-03 19:51:34,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:34,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:34,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:34,321 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-03 19:51:34,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:34,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:34,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:34,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:34,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:34,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:51:34,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:34,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:34,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:34,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-09-03 19:51:34,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:51:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:51:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:51:34,457 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2019-09-03 19:51:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:34,655 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-09-03 19:51:34,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:51:34,655 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2019-09-03 19:51:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:34,656 INFO L225 Difference]: With dead ends: 133 [2019-09-03 19:51:34,657 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 19:51:34,657 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-03 19:51:34,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 19:51:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-09-03 19:51:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 19:51:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-09-03 19:51:34,664 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 117 [2019-09-03 19:51:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:34,664 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-09-03 19:51:34,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:51:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-09-03 19:51:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 19:51:34,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:34,665 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:34,665 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:34,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:34,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1142366791, now seen corresponding path program 27 times [2019-09-03 19:51:34,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:34,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:34,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:34,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:35,391 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-03 19:51:35,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:35,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:35,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:35,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:51:35,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:35,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:51:35,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:35,893 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-03 19:51:35,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:35,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 48 [2019-09-03 19:51:35,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:51:35,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:51:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:51:35,897 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 48 states. [2019-09-03 19:51:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:36,662 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2019-09-03 19:51:36,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:51:36,663 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 124 [2019-09-03 19:51:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:36,664 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:51:36,664 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:51:36,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:51:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:51:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-03 19:51:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 19:51:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-03 19:51:36,677 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 124 [2019-09-03 19:51:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:36,678 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-03 19:51:36,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:51:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-03 19:51:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-03 19:51:36,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:36,679 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:36,679 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:36,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1971397784, now seen corresponding path program 28 times [2019-09-03 19:51:36,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:36,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:36,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:36,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:36,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:36,930 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-03 19:51:36,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:36,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:36,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:37,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:37,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:37,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:51:37,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:37,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:37,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:37,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2019-09-03 19:51:37,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:51:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:51:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:51:37,124 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 22 states. [2019-09-03 19:51:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:37,316 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-09-03 19:51:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:51:37,317 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-09-03 19:51:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:37,318 INFO L225 Difference]: With dead ends: 141 [2019-09-03 19:51:37,318 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 19:51:37,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:51:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 19:51:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-03 19:51:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 19:51:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-09-03 19:51:37,326 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 125 [2019-09-03 19:51:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:37,326 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-09-03 19:51:37,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:51:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-09-03 19:51:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 19:51:37,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:37,327 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:37,328 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:37,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1589168410, now seen corresponding path program 29 times [2019-09-03 19:51:37,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:37,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:37,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:37,752 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-03 19:51:37,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:37,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:37,762 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:37,835 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:51:37,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:37,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:51:37,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:38,421 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-03 19:51:38,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:38,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 51 [2019-09-03 19:51:38,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:51:38,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:51:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=1939, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:51:38,428 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 51 states. [2019-09-03 19:51:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:39,420 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2019-09-03 19:51:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:51:39,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 132 [2019-09-03 19:51:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:39,422 INFO L225 Difference]: With dead ends: 192 [2019-09-03 19:51:39,422 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 19:51:39,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1087, Invalid=3469, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:51:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 19:51:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-03 19:51:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 19:51:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-03 19:51:39,436 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 132 [2019-09-03 19:51:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:39,437 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-03 19:51:39,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:51:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-03 19:51:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-03 19:51:39,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:39,439 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:39,439 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:39,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -993417271, now seen corresponding path program 30 times [2019-09-03 19:51:39,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:39,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:39,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:39,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:39,724 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-03 19:51:39,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:39,724 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-03 19:51:39,737 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-03 19:51:39,796 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:51:39,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:39,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:51:39,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:39,851 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-03 19:51:39,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:39,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-03 19:51:39,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:51:39,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:51:39,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:51:39,862 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 23 states. [2019-09-03 19:51:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:40,030 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-09-03 19:51:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:51:40,030 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-09-03 19:51:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:40,031 INFO L225 Difference]: With dead ends: 149 [2019-09-03 19:51:40,031 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 19:51:40,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:51:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 19:51:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-09-03 19:51:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 19:51:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-09-03 19:51:40,040 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 133 [2019-09-03 19:51:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:40,041 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-09-03 19:51:40,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:51:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-09-03 19:51:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 19:51:40,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:40,043 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:40,044 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:40,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1455260263, now seen corresponding path program 31 times [2019-09-03 19:51:40,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:40,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:40,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:40,591 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-03 19:51:40,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:40,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:40,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:40,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:51:40,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:41,175 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-03 19:51:41,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:41,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 54 [2019-09-03 19:51:41,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:51:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:51:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:51:41,180 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 54 states. [2019-09-03 19:51:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:42,098 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2019-09-03 19:51:42,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:51:42,100 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 140 [2019-09-03 19:51:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:42,102 INFO L225 Difference]: With dead ends: 203 [2019-09-03 19:51:42,102 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 19:51:42,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1214, Invalid=3898, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:51:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 19:51:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-03 19:51:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-03 19:51:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-03 19:51:42,118 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 140 [2019-09-03 19:51:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:42,118 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-03 19:51:42,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:51:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-03 19:51:42,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 19:51:42,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:42,119 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:42,119 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:42,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1302512312, now seen corresponding path program 32 times [2019-09-03 19:51:42,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:42,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:42,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:42,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:42,382 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-03 19:51:42,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:42,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:42,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:42,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:42,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:42,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:51:42,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:42,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:42,494 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-03 19:51:42,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-09-03 19:51:42,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:51:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:51:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:51:42,498 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 24 states. [2019-09-03 19:51:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:42,671 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2019-09-03 19:51:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:51:42,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2019-09-03 19:51:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:42,673 INFO L225 Difference]: With dead ends: 157 [2019-09-03 19:51:42,673 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 19:51:42,673 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-03 19:51:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 19:51:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-09-03 19:51:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 19:51:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-09-03 19:51:42,684 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 141 [2019-09-03 19:51:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:42,684 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-09-03 19:51:42,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:51:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-09-03 19:51:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 19:51:42,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:42,685 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:42,686 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:42,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2015529786, now seen corresponding path program 33 times [2019-09-03 19:51:42,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:42,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:42,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:42,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:42,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:43,202 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-03 19:51:43,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:43,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:43,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:43,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 19:51:43,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:43,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:51:43,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:43,877 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-03 19:51:43,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:43,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 57 [2019-09-03 19:51:43,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:51:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:51:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=2433, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:51:43,882 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 57 states. [2019-09-03 19:51:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:44,859 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2019-09-03 19:51:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:51:44,859 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 148 [2019-09-03 19:51:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:44,860 INFO L225 Difference]: With dead ends: 214 [2019-09-03 19:51:44,860 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 19:51:44,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1348, Invalid=4352, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:51:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 19:51:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-03 19:51:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 19:51:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-03 19:51:44,870 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 148 [2019-09-03 19:51:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:44,870 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-03 19:51:44,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:51:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-03 19:51:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 19:51:44,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:44,872 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:44,872 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 819342313, now seen corresponding path program 34 times [2019-09-03 19:51:44,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:44,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:44,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:45,177 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-03 19:51:45,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:45,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:45,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:45,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:45,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:51:45,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:45,302 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-03 19:51:45,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:45,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-09-03 19:51:45,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:51:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:51:45,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:51:45,308 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 25 states. [2019-09-03 19:51:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:45,530 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2019-09-03 19:51:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:51:45,531 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2019-09-03 19:51:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:45,532 INFO L225 Difference]: With dead ends: 165 [2019-09-03 19:51:45,532 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 19:51:45,533 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-03 19:51:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 19:51:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-03 19:51:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 19:51:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-09-03 19:51:45,542 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2019-09-03 19:51:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:45,542 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-09-03 19:51:45,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:51:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-09-03 19:51:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 19:51:45,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:45,544 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:45,544 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:45,544 INFO L82 PathProgramCache]: Analyzing trace with hash -285272711, now seen corresponding path program 35 times [2019-09-03 19:51:45,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:45,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:45,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:46,144 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-03 19:51:46,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:46,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:46,155 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:46,215 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 19:51:46,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:46,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:51:46,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:46,979 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-03 19:51:46,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:46,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 60 [2019-09-03 19:51:46,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:51:46,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:51:46,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=2701, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:51:46,983 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 60 states. [2019-09-03 19:51:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:48,075 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2019-09-03 19:51:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:51:48,076 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 156 [2019-09-03 19:51:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:48,078 INFO L225 Difference]: With dead ends: 225 [2019-09-03 19:51:48,078 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 19:51:48,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1489, Invalid=4831, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:51:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 19:51:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-03 19:51:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 19:51:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-03 19:51:48,088 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 156 [2019-09-03 19:51:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:48,089 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-03 19:51:48,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:51:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-03 19:51:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 19:51:48,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:48,090 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:48,090 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1692047144, now seen corresponding path program 36 times [2019-09-03 19:51:48,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:48,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:48,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:48,372 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-03 19:51:48,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:48,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:48,390 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:48,462 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:51:48,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:48,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:51:48,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:48,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:48,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-09-03 19:51:48,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:51:48,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:51:48,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:51:48,547 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 26 states. [2019-09-03 19:51:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:48,769 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2019-09-03 19:51:48,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:51:48,770 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 157 [2019-09-03 19:51:48,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:48,772 INFO L225 Difference]: With dead ends: 173 [2019-09-03 19:51:48,772 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:51:48,773 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-03 19:51:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:51:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-09-03 19:51:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 19:51:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-09-03 19:51:48,783 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 157 [2019-09-03 19:51:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:48,784 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-09-03 19:51:48,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:51:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-09-03 19:51:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 19:51:48,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:48,786 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:48,786 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1666820774, now seen corresponding path program 37 times [2019-09-03 19:51:48,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:48,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:48,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:49,625 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-03 19:51:49,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:49,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:49,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:49,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:51:49,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:50,617 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-03 19:51:50,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:50,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 63 [2019-09-03 19:51:50,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:51:50,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:51:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=923, Invalid=2983, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:51:50,621 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 63 states. [2019-09-03 19:51:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:51,835 INFO L93 Difference]: Finished difference Result 236 states and 257 transitions. [2019-09-03 19:51:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:51:51,836 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 164 [2019-09-03 19:51:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:51,838 INFO L225 Difference]: With dead ends: 236 [2019-09-03 19:51:51,838 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 19:51:51,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1637, Invalid=5335, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:51:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 19:51:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-03 19:51:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 19:51:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-03 19:51:51,850 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 164 [2019-09-03 19:51:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:51,850 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-03 19:51:51,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:51:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-03 19:51:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 19:51:51,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:51,862 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:51,862 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash -566708215, now seen corresponding path program 38 times [2019-09-03 19:51:51,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:51,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:51,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:51,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:51,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:52,188 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-03 19:51:52,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:52,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:52,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:52,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:52,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:52,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:51:52,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:52,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:52,322 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-03 19:51:52,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:52,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-09-03 19:51:52,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:51:52,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:51:52,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:51:52,326 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 27 states. [2019-09-03 19:51:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:52,591 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2019-09-03 19:51:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:51:52,592 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 165 [2019-09-03 19:51:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:52,594 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:51:52,594 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 19:51:52,595 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-03 19:51:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 19:51:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2019-09-03 19:51:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 19:51:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-09-03 19:51:52,603 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 165 [2019-09-03 19:51:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:52,604 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-09-03 19:51:52,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:51:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-09-03 19:51:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 19:51:52,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:52,605 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:52,606 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash -267606695, now seen corresponding path program 39 times [2019-09-03 19:51:52,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:52,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:52,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:53,328 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-03 19:51:53,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:53,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:53,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 19:51:53,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:53,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:51:53,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:54,633 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-03 19:51:54,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:54,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 66 [2019-09-03 19:51:54,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:51:54,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:51:54,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=3279, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:51:54,639 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 66 states. [2019-09-03 19:51:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:56,057 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2019-09-03 19:51:56,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:51:56,059 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 172 [2019-09-03 19:51:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:56,061 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:51:56,061 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 19:51:56,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1792, Invalid=5864, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:51:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 19:51:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-03 19:51:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 19:51:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-03 19:51:56,083 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 172 [2019-09-03 19:51:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:56,083 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-03 19:51:56,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:51:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-03 19:51:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 19:51:56,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:56,085 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:56,085 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash 216328456, now seen corresponding path program 40 times [2019-09-03 19:51:56,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:56,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:56,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:56,462 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-03 19:51:56,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:56,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:56,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:56,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:56,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:56,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:51:56,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:56,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:56,601 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-03 19:51:56,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:56,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2019-09-03 19:51:56,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:51:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:51:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:51:56,606 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 28 states. [2019-09-03 19:51:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:56,823 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2019-09-03 19:51:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:51:56,825 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 173 [2019-09-03 19:51:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:56,827 INFO L225 Difference]: With dead ends: 189 [2019-09-03 19:51:56,828 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 19:51:56,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:51:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 19:51:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-09-03 19:51:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 19:51:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-09-03 19:51:56,838 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 173 [2019-09-03 19:51:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:56,838 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-09-03 19:51:56,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:51:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-09-03 19:51:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 19:51:56,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:56,839 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:56,840 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash -644470918, now seen corresponding path program 41 times [2019-09-03 19:51:56,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:56,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:56,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:57,551 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-03 19:51:57,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:57,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:57,563 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:57,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-03 19:51:57,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:57,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:51:57,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:58,516 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-03 19:51:58,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:58,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 69 [2019-09-03 19:51:58,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:51:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:51:58,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1103, Invalid=3589, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:51:58,522 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 69 states. [2019-09-03 19:51:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:59,968 INFO L93 Difference]: Finished difference Result 258 states and 281 transitions. [2019-09-03 19:51:59,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:51:59,974 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 180 [2019-09-03 19:51:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:59,975 INFO L225 Difference]: With dead ends: 258 [2019-09-03 19:51:59,975 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 19:51:59,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1954, Invalid=6418, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:51:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 19:51:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-03 19:51:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 19:51:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-03 19:51:59,991 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 180 [2019-09-03 19:51:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:59,991 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-03 19:51:59,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:51:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-03 19:51:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 19:51:59,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:59,992 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:59,993 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash -498906071, now seen corresponding path program 42 times [2019-09-03 19:51:59,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:59,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:59,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:59,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:00,536 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-03 19:52:00,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:00,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:00,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:00,619 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-03 19:52:00,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:00,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:52:00,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:00,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:00,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:00,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-09-03 19:52:00,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:52:00,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:52:00,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:52:00,684 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 29 states. [2019-09-03 19:52:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:00,925 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2019-09-03 19:52:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:52:00,926 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 181 [2019-09-03 19:52:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:00,928 INFO L225 Difference]: With dead ends: 197 [2019-09-03 19:52:00,928 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 19:52:00,929 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-03 19:52:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 19:52:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-09-03 19:52:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 19:52:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-09-03 19:52:00,939 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 181 [2019-09-03 19:52:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:00,939 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-09-03 19:52:00,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:52:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-09-03 19:52:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 19:52:00,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:00,941 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:00,941 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1457073465, now seen corresponding path program 43 times [2019-09-03 19:52:00,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:00,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:00,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:01,744 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-03 19:52:01,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:01,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:01,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:01,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:52:01,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:02,875 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-03 19:52:02,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:02,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 72 [2019-09-03 19:52:02,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 19:52:02,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 19:52:02,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=3913, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:52:02,879 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 72 states. [2019-09-03 19:52:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:04,438 INFO L93 Difference]: Finished difference Result 269 states and 293 transitions. [2019-09-03 19:52:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:52:04,438 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 188 [2019-09-03 19:52:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:04,440 INFO L225 Difference]: With dead ends: 269 [2019-09-03 19:52:04,440 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 19:52:04,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2123, Invalid=6997, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:52:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 19:52:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-09-03 19:52:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 19:52:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-03 19:52:04,451 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 188 [2019-09-03 19:52:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:04,451 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-03 19:52:04,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 19:52:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-03 19:52:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 19:52:04,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:04,453 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:04,453 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1558852328, now seen corresponding path program 44 times [2019-09-03 19:52:04,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:04,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:04,786 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-03 19:52:04,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:04,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:04,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:04,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:04,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:04,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:52:04,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:04,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:04,927 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-03 19:52:04,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:04,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2019-09-03 19:52:04,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:52:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:52:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:52:04,931 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 30 states. [2019-09-03 19:52:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:05,228 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2019-09-03 19:52:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:52:05,229 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 189 [2019-09-03 19:52:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:05,231 INFO L225 Difference]: With dead ends: 205 [2019-09-03 19:52:05,231 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 19:52:05,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:52:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 19:52:05,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-03 19:52:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 19:52:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-09-03 19:52:05,241 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 189 [2019-09-03 19:52:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:05,242 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-09-03 19:52:05,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:52:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-09-03 19:52:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 19:52:05,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:05,243 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:05,244 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:05,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2067529318, now seen corresponding path program 45 times [2019-09-03 19:52:05,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:05,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:05,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:05,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:05,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:06,123 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-03 19:52:06,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:06,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:06,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 19:52:06,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:06,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:52:06,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:07,279 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-03 19:52:07,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:07,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 75 [2019-09-03 19:52:07,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 19:52:07,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 19:52:07,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=4251, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:52:07,284 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 75 states. [2019-09-03 19:52:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:08,527 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2019-09-03 19:52:08,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:52:08,527 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 196 [2019-09-03 19:52:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:08,528 INFO L225 Difference]: With dead ends: 280 [2019-09-03 19:52:08,528 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 19:52:08,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2299, Invalid=7601, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:52:08,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 19:52:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-09-03 19:52:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 19:52:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-03 19:52:08,540 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 196 [2019-09-03 19:52:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:08,541 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-03 19:52:08,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 19:52:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-03 19:52:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 19:52:08,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:08,542 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:08,543 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:08,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1698174903, now seen corresponding path program 46 times [2019-09-03 19:52:08,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:08,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:08,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:08,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:08,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:09,079 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-03 19:52:09,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:09,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:09,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:09,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:09,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:09,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:52:09,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:09,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:09,350 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-03 19:52:09,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:09,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-09-03 19:52:09,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:52:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:52:09,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:52:09,358 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 31 states. [2019-09-03 19:52:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:09,670 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2019-09-03 19:52:09,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:52:09,671 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 197 [2019-09-03 19:52:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:09,673 INFO L225 Difference]: With dead ends: 213 [2019-09-03 19:52:09,673 INFO L226 Difference]: Without dead ends: 211 [2019-09-03 19:52:09,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:52:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-03 19:52:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2019-09-03 19:52:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 19:52:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-09-03 19:52:09,691 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 197 [2019-09-03 19:52:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:09,691 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-09-03 19:52:09,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:52:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-09-03 19:52:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 19:52:09,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:09,694 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:09,694 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash -179131111, now seen corresponding path program 47 times [2019-09-03 19:52:09,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:09,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:09,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:09,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:09,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:11,460 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-03 19:52:11,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:11,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:11,572 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-03 19:52:11,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:11,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:52:11,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:12,613 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-03 19:52:12,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:12,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 78 [2019-09-03 19:52:12,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 19:52:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 19:52:12,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=4603, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:52:12,617 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 78 states. [2019-09-03 19:52:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:14,198 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2019-09-03 19:52:14,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:52:14,198 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 204 [2019-09-03 19:52:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:14,199 INFO L225 Difference]: With dead ends: 291 [2019-09-03 19:52:14,199 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 19:52:14,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2482, Invalid=8230, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:52:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 19:52:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-09-03 19:52:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 19:52:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-03 19:52:14,210 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 204 [2019-09-03 19:52:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:14,210 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-03 19:52:14,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 19:52:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-03 19:52:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 19:52:14,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:14,212 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:14,212 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:14,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:14,213 INFO L82 PathProgramCache]: Analyzing trace with hash 785937608, now seen corresponding path program 48 times [2019-09-03 19:52:14,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:14,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:14,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:14,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:14,768 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-03 19:52:14,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:14,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:14,797 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:14,946 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:52:14,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:14,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:52:14,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:15,047 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-03 19:52:15,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:15,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2019-09-03 19:52:15,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:52:15,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:52:15,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:52:15,053 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 32 states. [2019-09-03 19:52:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:15,365 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2019-09-03 19:52:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:52:15,365 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-09-03 19:52:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:15,367 INFO L225 Difference]: With dead ends: 221 [2019-09-03 19:52:15,367 INFO L226 Difference]: Without dead ends: 219 [2019-09-03 19:52:15,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:52:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-03 19:52:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2019-09-03 19:52:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 19:52:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-09-03 19:52:15,378 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 205 [2019-09-03 19:52:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:15,379 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-09-03 19:52:15,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:52:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-09-03 19:52:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 19:52:15,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:15,380 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:15,381 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:15,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1552016314, now seen corresponding path program 49 times [2019-09-03 19:52:15,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:15,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:15,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:16,487 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-03 19:52:16,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:16,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:16,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:16,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:52:16,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:17,892 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-03 19:52:17,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:17,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 81 [2019-09-03 19:52:17,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 19:52:17,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 19:52:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1511, Invalid=4969, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:52:17,897 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 81 states. [2019-09-03 19:52:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:18,895 INFO L93 Difference]: Finished difference Result 302 states and 329 transitions. [2019-09-03 19:52:18,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:52:18,896 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 212 [2019-09-03 19:52:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:18,897 INFO L225 Difference]: With dead ends: 302 [2019-09-03 19:52:18,897 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 19:52:18,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2672, Invalid=8884, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:52:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 19:52:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-03 19:52:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-03 19:52:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2019-09-03 19:52:18,910 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 212 [2019-09-03 19:52:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:18,911 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2019-09-03 19:52:18,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 19:52:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2019-09-03 19:52:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-03 19:52:18,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:18,912 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:18,913 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash -837251991, now seen corresponding path program 50 times [2019-09-03 19:52:18,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:19,500 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-03 19:52:19,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:19,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:19,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:19,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:19,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:19,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:52:19,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:19,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:19,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:19,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-09-03 19:52:19,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:52:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:52:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:52:19,789 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 33 states. [2019-09-03 19:52:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:20,099 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2019-09-03 19:52:20,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:52:20,099 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 213 [2019-09-03 19:52:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:20,101 INFO L225 Difference]: With dead ends: 229 [2019-09-03 19:52:20,102 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 19:52:20,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=422, Invalid=700, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:52:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 19:52:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-09-03 19:52:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 19:52:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-09-03 19:52:20,113 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 213 [2019-09-03 19:52:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:20,113 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2019-09-03 19:52:20,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:52:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2019-09-03 19:52:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 19:52:20,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:20,115 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:20,115 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1528355591, now seen corresponding path program 51 times [2019-09-03 19:52:20,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:20,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:21,227 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-03 19:52:21,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:21,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:21,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:21,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 19:52:21,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:21,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:52:21,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (52)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:52:22,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:22,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 84 [2019-09-03 19:52:22,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 19:52:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 19:52:22,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1623, Invalid=5349, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:52:22,503 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 84 states. [2019-09-03 19:52:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:24,641 INFO L93 Difference]: Finished difference Result 313 states and 341 transitions. [2019-09-03 19:52:24,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:52:24,642 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 220 [2019-09-03 19:52:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:24,643 INFO L225 Difference]: With dead ends: 313 [2019-09-03 19:52:24,643 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 19:52:24,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2869, Invalid=9563, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:52:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 19:52:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-09-03 19:52:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-03 19:52:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2019-09-03 19:52:24,657 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 220 [2019-09-03 19:52:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:24,657 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2019-09-03 19:52:24,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 19:52:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2019-09-03 19:52:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-03 19:52:24,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:24,659 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:24,659 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:24,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1679666856, now seen corresponding path program 52 times [2019-09-03 19:52:24,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:24,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:24,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:24,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:25,203 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-03 19:52:25,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:25,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:52:25,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:25,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:25,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:25,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:52:25,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:25,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:25,414 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-03 19:52:25,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:25,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2019-09-03 19:52:25,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:52:25,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:52:25,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:52:25,419 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 34 states. [2019-09-03 19:52:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:25,756 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2019-09-03 19:52:25,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:52:25,756 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 221 [2019-09-03 19:52:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:25,758 INFO L225 Difference]: With dead ends: 237 [2019-09-03 19:52:25,758 INFO L226 Difference]: Without dead ends: 235 [2019-09-03 19:52:25,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:52:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-03 19:52:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2019-09-03 19:52:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 19:52:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-09-03 19:52:25,769 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 221 [2019-09-03 19:52:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:25,770 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2019-09-03 19:52:25,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:52:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2019-09-03 19:52:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 19:52:25,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:25,771 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:25,771 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1482568230, now seen corresponding path program 53 times [2019-09-03 19:52:25,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:25,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:26,931 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-03 19:52:26,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:26,931 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-03 19:52:26,949 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-03 19:52:27,061 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-03 19:52:27,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:27,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:52:27,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:28,541 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-03 19:52:28,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:28,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 87 [2019-09-03 19:52:28,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 19:52:28,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 19:52:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1739, Invalid=5743, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:52:28,546 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 87 states. [2019-09-03 19:52:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:30,785 INFO L93 Difference]: Finished difference Result 324 states and 353 transitions. [2019-09-03 19:52:30,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:52:30,786 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 228 [2019-09-03 19:52:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:30,787 INFO L225 Difference]: With dead ends: 324 [2019-09-03 19:52:30,787 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 19:52:30,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2674 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3073, Invalid=10267, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 19:52:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 19:52:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-09-03 19:52:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-03 19:52:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2019-09-03 19:52:30,798 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 228 [2019-09-03 19:52:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:30,799 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2019-09-03 19:52:30,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 19:52:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2019-09-03 19:52:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-03 19:52:30,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:30,801 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:30,801 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash -888719223, now seen corresponding path program 54 times [2019-09-03 19:52:30,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:30,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:31,404 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-03 19:52:31,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:31,404 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) [2019-09-03 19:52:31,416 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:31,510 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-03 19:52:31,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:31,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:52:31,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (55)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:52:31,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:31,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-09-03 19:52:31,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:52:31,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:52:31,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:52:31,611 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 35 states. [2019-09-03 19:52:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:31,950 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2019-09-03 19:52:31,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:52:31,951 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 229 [2019-09-03 19:52:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:31,952 INFO L225 Difference]: With dead ends: 245 [2019-09-03 19:52:31,952 INFO L226 Difference]: Without dead ends: 243 [2019-09-03 19:52:31,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:52:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-03 19:52:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-09-03 19:52:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-03 19:52:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-09-03 19:52:31,965 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 229 [2019-09-03 19:52:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:31,965 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2019-09-03 19:52:31,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:52:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2019-09-03 19:52:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 19:52:31,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:31,967 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:31,967 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash 646223065, now seen corresponding path program 55 times [2019-09-03 19:52:31,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:31,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:33,165 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-03 19:52:33,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:33,165 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-03 19:52:33,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:33,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:52:33,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:34,675 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-03 19:52:34,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:34,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 90 [2019-09-03 19:52:34,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 19:52:34,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 19:52:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1859, Invalid=6151, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:52:34,680 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 90 states. [2019-09-03 19:52:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:37,051 INFO L93 Difference]: Finished difference Result 335 states and 365 transitions. [2019-09-03 19:52:37,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:52:37,051 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 236 [2019-09-03 19:52:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:37,052 INFO L225 Difference]: With dead ends: 335 [2019-09-03 19:52:37,053 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 19:52:37,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3284, Invalid=10996, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 19:52:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 19:52:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-09-03 19:52:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-03 19:52:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2019-09-03 19:52:37,066 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 236 [2019-09-03 19:52:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:37,066 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2019-09-03 19:52:37,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 19:52:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2019-09-03 19:52:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-03 19:52:37,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:37,068 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:37,068 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash -978853752, now seen corresponding path program 56 times [2019-09-03 19:52:37,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:37,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:37,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:37,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:37,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:37,594 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-03 19:52:37,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:37,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:37,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:37,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:37,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:37,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:52:37,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:37,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:37,762 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-03 19:52:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:37,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 36 [2019-09-03 19:52:37,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:52:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:52:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:52:37,766 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 36 states. [2019-09-03 19:52:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:38,038 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2019-09-03 19:52:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:52:38,038 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 237 [2019-09-03 19:52:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:38,040 INFO L225 Difference]: With dead ends: 253 [2019-09-03 19:52:38,040 INFO L226 Difference]: Without dead ends: 251 [2019-09-03 19:52:38,041 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-03 19:52:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-03 19:52:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2019-09-03 19:52:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-03 19:52:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2019-09-03 19:52:38,052 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 237 [2019-09-03 19:52:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:38,052 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2019-09-03 19:52:38,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:52:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2019-09-03 19:52:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-03 19:52:38,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:38,054 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:38,054 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:38,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:38,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1433780218, now seen corresponding path program 57 times [2019-09-03 19:52:38,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:38,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:38,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:39,325 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-03 19:52:39,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:39,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:39,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:39,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 19:52:39,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:52:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:40,891 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-03 19:52:40,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:40,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 93 [2019-09-03 19:52:40,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 19:52:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 19:52:40,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1983, Invalid=6573, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:52:40,897 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 93 states. [2019-09-03 19:52:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:43,370 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2019-09-03 19:52:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:52:43,375 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 244 [2019-09-03 19:52:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:43,377 INFO L225 Difference]: With dead ends: 346 [2019-09-03 19:52:43,377 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 19:52:43,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3075 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3502, Invalid=11750, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:52:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 19:52:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-09-03 19:52:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-03 19:52:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2019-09-03 19:52:43,390 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 244 [2019-09-03 19:52:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:43,390 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2019-09-03 19:52:43,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 19:52:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2019-09-03 19:52:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-03 19:52:43,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:43,392 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:43,392 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:43,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1998197591, now seen corresponding path program 58 times [2019-09-03 19:52:43,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:43,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:43,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:43,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:43,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:43,886 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-03 19:52:43,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:43,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:43,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:43,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:43,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:43,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:52:43,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:43,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:44,071 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-03 19:52:44,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:44,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-09-03 19:52:44,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:52:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:52:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:52:44,076 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 37 states. [2019-09-03 19:52:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:44,427 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2019-09-03 19:52:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:52:44,428 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 245 [2019-09-03 19:52:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:44,430 INFO L225 Difference]: With dead ends: 261 [2019-09-03 19:52:44,430 INFO L226 Difference]: Without dead ends: 259 [2019-09-03 19:52:44,430 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-03 19:52:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-03 19:52:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-03 19:52:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 19:52:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2019-09-03 19:52:44,442 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 245 [2019-09-03 19:52:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:44,443 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2019-09-03 19:52:44,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:52:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2019-09-03 19:52:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 19:52:44,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:44,445 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:44,445 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash 43580601, now seen corresponding path program 59 times [2019-09-03 19:52:44,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:44,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:44,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:45,826 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-03 19:52:45,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:45,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:45,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:45,952 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-03 19:52:45,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:45,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:52:45,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:47,444 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-03 19:52:47,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:47,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 96 [2019-09-03 19:52:47,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 19:52:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 19:52:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=7009, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:52:47,449 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 96 states. [2019-09-03 19:52:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:50,066 INFO L93 Difference]: Finished difference Result 357 states and 389 transitions. [2019-09-03 19:52:50,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:52:50,071 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 252 [2019-09-03 19:52:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:50,073 INFO L225 Difference]: With dead ends: 357 [2019-09-03 19:52:50,073 INFO L226 Difference]: Without dead ends: 256 [2019-09-03 19:52:50,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3286 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3727, Invalid=12529, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 19:52:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-03 19:52:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-09-03 19:52:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-03 19:52:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2019-09-03 19:52:50,086 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 252 [2019-09-03 19:52:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:50,086 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2019-09-03 19:52:50,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 19:52:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2019-09-03 19:52:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-03 19:52:50,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:50,088 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:50,089 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash -471528856, now seen corresponding path program 60 times [2019-09-03 19:52:50,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:50,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:50,659 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-03 19:52:50,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:50,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:50,772 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:52:50,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:50,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:52:50,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:50,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:50,852 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-03 19:52:50,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:50,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2019-09-03 19:52:50,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:52:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:52:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:52:50,857 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 38 states. [2019-09-03 19:52:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:51,219 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2019-09-03 19:52:51,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:52:51,220 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 253 [2019-09-03 19:52:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:51,221 INFO L225 Difference]: With dead ends: 269 [2019-09-03 19:52:51,222 INFO L226 Difference]: Without dead ends: 267 [2019-09-03 19:52:51,222 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-03 19:52:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-03 19:52:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2019-09-03 19:52:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-03 19:52:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2019-09-03 19:52:51,235 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 253 [2019-09-03 19:52:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:51,236 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2019-09-03 19:52:51,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:52:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2019-09-03 19:52:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 19:52:51,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:51,238 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:51,238 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash 500152858, now seen corresponding path program 61 times [2019-09-03 19:52:51,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:51,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:51,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:51,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:52,708 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-03 19:52:52,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:52,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:52,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:52,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:52:52,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:54,426 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-03 19:52:54,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:54,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 99 [2019-09-03 19:52:54,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 19:52:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 19:52:54,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2243, Invalid=7459, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:52:54,430 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 99 states. [2019-09-03 19:52:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:57,232 INFO L93 Difference]: Finished difference Result 368 states and 401 transitions. [2019-09-03 19:52:57,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:52:57,232 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 260 [2019-09-03 19:52:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:57,233 INFO L225 Difference]: With dead ends: 368 [2019-09-03 19:52:57,233 INFO L226 Difference]: Without dead ends: 264 [2019-09-03 19:52:57,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3504 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3959, Invalid=13333, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 19:52:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-03 19:52:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-09-03 19:52:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-03 19:52:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2019-09-03 19:52:57,247 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 260 [2019-09-03 19:52:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:57,247 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2019-09-03 19:52:57,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 19:52:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2019-09-03 19:52:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-03 19:52:57,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:57,249 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:57,250 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:57,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash -947476279, now seen corresponding path program 62 times [2019-09-03 19:52:57,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:57,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:57,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:57,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:57,851 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-03 19:52:57,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:57,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:57,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:57,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:57,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:57,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:52:57,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:57,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:58,026 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-03 19:52:58,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:58,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-09-03 19:52:58,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:52:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:52:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=877, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:52:58,031 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 39 states. [2019-09-03 19:52:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:58,350 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2019-09-03 19:52:58,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:52:58,350 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 261 [2019-09-03 19:52:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:58,352 INFO L225 Difference]: With dead ends: 277 [2019-09-03 19:52:58,352 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 19:52:58,353 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-03 19:52:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 19:52:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2019-09-03 19:52:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 19:52:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2019-09-03 19:52:58,366 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 261 [2019-09-03 19:52:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:58,366 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2019-09-03 19:52:58,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:52:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2019-09-03 19:52:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-03 19:52:58,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:58,369 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:58,369 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1762811033, now seen corresponding path program 63 times [2019-09-03 19:52:58,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:58,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:58,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:59,824 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-03 19:52:59,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:59,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:59,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:59,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 19:52:59,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:59,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:52:59,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:01,650 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-03 19:53:01,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:01,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 102 [2019-09-03 19:53:01,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 19:53:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 19:53:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2379, Invalid=7923, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:53:01,656 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 102 states. [2019-09-03 19:53:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:04,612 INFO L93 Difference]: Finished difference Result 379 states and 413 transitions. [2019-09-03 19:53:04,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:53:04,612 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 268 [2019-09-03 19:53:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:04,613 INFO L225 Difference]: With dead ends: 379 [2019-09-03 19:53:04,614 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 19:53:04,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3729 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4198, Invalid=14162, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 19:53:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 19:53:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-03 19:53:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-03 19:53:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 273 transitions. [2019-09-03 19:53:04,631 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 273 transitions. Word has length 268 [2019-09-03 19:53:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:04,631 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 273 transitions. [2019-09-03 19:53:04,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 19:53:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 273 transitions. [2019-09-03 19:53:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-03 19:53:04,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:04,642 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:04,642 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash -154981304, now seen corresponding path program 64 times [2019-09-03 19:53:04,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:04,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:04,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:04,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:05,245 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-03 19:53:05,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:05,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:05,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:05,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:05,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:05,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 19:53:05,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:05,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:05,476 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-03 19:53:05,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:05,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 40 [2019-09-03 19:53:05,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:53:05,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:53:05,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:53:05,482 INFO L87 Difference]: Start difference. First operand 272 states and 273 transitions. Second operand 40 states. [2019-09-03 19:53:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:05,854 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2019-09-03 19:53:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:53:05,854 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 269 [2019-09-03 19:53:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:05,856 INFO L225 Difference]: With dead ends: 285 [2019-09-03 19:53:05,856 INFO L226 Difference]: Without dead ends: 283 [2019-09-03 19:53:05,857 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-03 19:53:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-03 19:53:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2019-09-03 19:53:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 19:53:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2019-09-03 19:53:05,868 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 269 [2019-09-03 19:53:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:05,868 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2019-09-03 19:53:05,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:53:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2019-09-03 19:53:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 19:53:05,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:05,870 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:05,870 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1593721798, now seen corresponding path program 65 times [2019-09-03 19:53:05,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:05,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:05,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:07,450 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-03 19:53:07,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:07,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:07,461 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:07,568 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-03 19:53:07,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:07,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:53:07,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:09,325 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-03 19:53:09,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:09,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 105 [2019-09-03 19:53:09,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 19:53:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 19:53:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2519, Invalid=8401, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 19:53:09,331 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 105 states. [2019-09-03 19:53:12,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:12,475 INFO L93 Difference]: Finished difference Result 390 states and 425 transitions. [2019-09-03 19:53:12,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:53:12,475 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 276 [2019-09-03 19:53:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:12,477 INFO L225 Difference]: With dead ends: 390 [2019-09-03 19:53:12,477 INFO L226 Difference]: Without dead ends: 280 [2019-09-03 19:53:12,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3961 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4444, Invalid=15016, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 19:53:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-03 19:53:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-09-03 19:53:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-03 19:53:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2019-09-03 19:53:12,491 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 276 [2019-09-03 19:53:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:12,491 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2019-09-03 19:53:12,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 19:53:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2019-09-03 19:53:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-03 19:53:12,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:12,493 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:12,493 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 792423657, now seen corresponding path program 66 times [2019-09-03 19:53:12,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:12,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:12,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:12,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:13,085 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-03 19:53:13,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:13,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:13,096 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:13,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-03 19:53:13,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:13,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:53:13,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:13,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:13,307 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-03 19:53:13,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:13,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-09-03 19:53:13,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:53:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:53:13,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:53:13,312 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 41 states. [2019-09-03 19:53:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:13,705 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2019-09-03 19:53:13,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:53:13,705 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 277 [2019-09-03 19:53:13,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:13,707 INFO L225 Difference]: With dead ends: 293 [2019-09-03 19:53:13,707 INFO L226 Difference]: Without dead ends: 291 [2019-09-03 19:53:13,708 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-03 19:53:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-03 19:53:13,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2019-09-03 19:53:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 19:53:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2019-09-03 19:53:13,723 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 277 [2019-09-03 19:53:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:13,723 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2019-09-03 19:53:13,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:53:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2019-09-03 19:53:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-03 19:53:13,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:13,726 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:13,726 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:13,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash 291419257, now seen corresponding path program 67 times [2019-09-03 19:53:13,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:13,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:13,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:13,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:13,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:15,341 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-03 19:53:15,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:15,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:15,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:15,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 19:53:15,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:17,336 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-03 19:53:17,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:17,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 108 [2019-09-03 19:53:17,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 19:53:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 19:53:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2663, Invalid=8893, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:53:17,342 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 108 states. [2019-09-03 19:53:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:19,721 INFO L93 Difference]: Finished difference Result 401 states and 437 transitions. [2019-09-03 19:53:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 19:53:19,721 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 284 [2019-09-03 19:53:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:19,722 INFO L225 Difference]: With dead ends: 401 [2019-09-03 19:53:19,722 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 19:53:19,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4200 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4697, Invalid=15895, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 19:53:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 19:53:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-03 19:53:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-03 19:53:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2019-09-03 19:53:19,733 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 284 [2019-09-03 19:53:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:19,733 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2019-09-03 19:53:19,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 19:53:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2019-09-03 19:53:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-03 19:53:19,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:19,735 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:19,735 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1112521176, now seen corresponding path program 68 times [2019-09-03 19:53:19,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:19,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:19,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:19,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:19,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:20,329 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-03 19:53:20,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:20,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:20,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:20,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:20,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:20,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:53:20,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:20,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (69)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:20,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:20,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2019-09-03 19:53:20,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:53:20,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:53:20,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:53:20,565 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 42 states. [2019-09-03 19:53:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:20,934 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2019-09-03 19:53:20,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:53:20,935 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 285 [2019-09-03 19:53:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:20,936 INFO L225 Difference]: With dead ends: 301 [2019-09-03 19:53:20,937 INFO L226 Difference]: Without dead ends: 299 [2019-09-03 19:53:20,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:53:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-03 19:53:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2019-09-03 19:53:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 19:53:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2019-09-03 19:53:20,950 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 285 [2019-09-03 19:53:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:20,951 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2019-09-03 19:53:20,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:53:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2019-09-03 19:53:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 19:53:20,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:20,953 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:20,953 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2015508902, now seen corresponding path program 69 times [2019-09-03 19:53:20,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:20,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:20,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:20,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:20,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:22,628 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-03 19:53:22,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:22,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:22,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:22,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 19:53:22,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:22,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:53:22,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:24,799 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-03 19:53:24,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:24,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 111 [2019-09-03 19:53:24,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 19:53:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 19:53:24,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2811, Invalid=9399, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:53:24,805 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 111 states. [2019-09-03 19:53:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:27,299 INFO L93 Difference]: Finished difference Result 412 states and 449 transitions. [2019-09-03 19:53:27,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:53:27,299 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 292 [2019-09-03 19:53:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:27,300 INFO L225 Difference]: With dead ends: 412 [2019-09-03 19:53:27,301 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 19:53:27,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4446 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4957, Invalid=16799, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:53:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 19:53:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-03 19:53:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 19:53:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2019-09-03 19:53:27,315 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 292 [2019-09-03 19:53:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:27,316 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2019-09-03 19:53:27,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 19:53:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2019-09-03 19:53:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-03 19:53:27,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:27,317 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:27,318 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1893087497, now seen corresponding path program 70 times [2019-09-03 19:53:27,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:27,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:27,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:27,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:27,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:27,945 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-03 19:53:27,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:27,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:27,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:28,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:28,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:28,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:53:28,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:28,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:28,157 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-03 19:53:28,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:28,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-09-03 19:53:28,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:53:28,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:53:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:53:28,162 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 43 states. [2019-09-03 19:53:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:28,606 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2019-09-03 19:53:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:53:28,606 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 293 [2019-09-03 19:53:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:28,608 INFO L225 Difference]: With dead ends: 309 [2019-09-03 19:53:28,609 INFO L226 Difference]: Without dead ends: 307 [2019-09-03 19:53:28,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:53:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-03 19:53:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-09-03 19:53:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 19:53:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2019-09-03 19:53:28,621 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 293 [2019-09-03 19:53:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:28,621 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2019-09-03 19:53:28,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:53:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2019-09-03 19:53:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 19:53:28,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:28,622 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:28,622 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:28,623 INFO L82 PathProgramCache]: Analyzing trace with hash 443286617, now seen corresponding path program 71 times [2019-09-03 19:53:28,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:28,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:28,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:28,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:28,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:30,414 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-03 19:53:30,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:30,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:30,425 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:30,549 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-03 19:53:30,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:30,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:53:30,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:32,652 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-03 19:53:32,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:32,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 114 [2019-09-03 19:53:32,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-03 19:53:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-03 19:53:32,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2963, Invalid=9919, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 19:53:32,658 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 114 states. [2019-09-03 19:53:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:35,343 INFO L93 Difference]: Finished difference Result 423 states and 461 transitions. [2019-09-03 19:53:35,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:53:35,356 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 300 [2019-09-03 19:53:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:35,358 INFO L225 Difference]: With dead ends: 423 [2019-09-03 19:53:35,358 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 19:53:35,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5224, Invalid=17728, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 19:53:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 19:53:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-03 19:53:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-03 19:53:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2019-09-03 19:53:35,375 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 300 [2019-09-03 19:53:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:35,375 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2019-09-03 19:53:35,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-03 19:53:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2019-09-03 19:53:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-03 19:53:35,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:35,377 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:35,377 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:35,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1603950600, now seen corresponding path program 72 times [2019-09-03 19:53:35,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:35,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:35,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:35,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:35,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:36,036 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-03 19:53:36,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:36,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:36,046 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:36,174 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:53:36,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:36,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 19:53:36,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:36,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:36,300 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-03 19:53:36,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:36,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2019-09-03 19:53:36,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:53:36,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:53:36,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:53:36,305 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 44 states. [2019-09-03 19:53:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:36,718 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2019-09-03 19:53:36,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:53:36,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 301 [2019-09-03 19:53:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:36,721 INFO L225 Difference]: With dead ends: 317 [2019-09-03 19:53:36,721 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 19:53:36,722 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-03 19:53:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 19:53:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-09-03 19:53:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-03 19:53:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2019-09-03 19:53:36,754 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 301 [2019-09-03 19:53:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:36,754 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2019-09-03 19:53:36,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:53:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2019-09-03 19:53:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-03 19:53:36,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:36,759 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:36,759 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:36,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1548363654, now seen corresponding path program 73 times [2019-09-03 19:53:36,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:36,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:36,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:36,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:36,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:38,634 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-03 19:53:38,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:38,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:38,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:38,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:53:38,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:41,007 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-03 19:53:41,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:41,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 117 [2019-09-03 19:53:41,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 19:53:41,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 19:53:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3119, Invalid=10453, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:53:41,012 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 117 states. [2019-09-03 19:53:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:43,895 INFO L93 Difference]: Finished difference Result 434 states and 473 transitions. [2019-09-03 19:53:43,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:53:43,895 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 308 [2019-09-03 19:53:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:43,897 INFO L225 Difference]: With dead ends: 434 [2019-09-03 19:53:43,898 INFO L226 Difference]: Without dead ends: 312 [2019-09-03 19:53:43,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4959 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5498, Invalid=18682, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 19:53:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-03 19:53:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-09-03 19:53:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-03 19:53:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2019-09-03 19:53:43,911 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 308 [2019-09-03 19:53:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:43,912 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2019-09-03 19:53:43,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 19:53:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2019-09-03 19:53:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-03 19:53:43,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:43,913 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:43,913 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:43,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1705577769, now seen corresponding path program 74 times [2019-09-03 19:53:43,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:43,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:43,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:43,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:44,579 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-03 19:53:44,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:44,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:44,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:44,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:44,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:44,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 19:53:44,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:44,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:44,772 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-03 19:53:44,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:44,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-09-03 19:53:44,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:53:44,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:53:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:53:44,778 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 45 states. [2019-09-03 19:53:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:45,226 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2019-09-03 19:53:45,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:53:45,227 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 309 [2019-09-03 19:53:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:45,229 INFO L225 Difference]: With dead ends: 325 [2019-09-03 19:53:45,229 INFO L226 Difference]: Without dead ends: 323 [2019-09-03 19:53:45,229 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-03 19:53:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-03 19:53:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-09-03 19:53:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-03 19:53:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2019-09-03 19:53:45,241 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 309 [2019-09-03 19:53:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:45,241 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2019-09-03 19:53:45,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:53:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2019-09-03 19:53:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 19:53:45,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:45,257 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:45,258 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:45,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:45,258 INFO L82 PathProgramCache]: Analyzing trace with hash -358069191, now seen corresponding path program 75 times [2019-09-03 19:53:45,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:45,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:47,197 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-03 19:53:47,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:47,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:47,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:47,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-03 19:53:47,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:47,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 19:53:47,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:49,685 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-03 19:53:49,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:49,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 120 [2019-09-03 19:53:49,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-03 19:53:49,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-03 19:53:49,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3279, Invalid=11001, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 19:53:49,691 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 120 states. [2019-09-03 19:53:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:52,762 INFO L93 Difference]: Finished difference Result 445 states and 485 transitions. [2019-09-03 19:53:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:53:52,763 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 316 [2019-09-03 19:53:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:52,764 INFO L225 Difference]: With dead ends: 445 [2019-09-03 19:53:52,764 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 19:53:52,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5226 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5779, Invalid=19661, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 19:53:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 19:53:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-03 19:53:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-03 19:53:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2019-09-03 19:53:52,784 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 316 [2019-09-03 19:53:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:52,785 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2019-09-03 19:53:52,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-03 19:53:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2019-09-03 19:53:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-03 19:53:52,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:52,787 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:52,787 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1257202152, now seen corresponding path program 76 times [2019-09-03 19:53:52,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:52,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:52,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:52,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:53,527 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-03 19:53:53,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:53,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:53,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:53,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:53,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:53,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:53:53,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:53,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (77)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:53,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:53,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 46 [2019-09-03 19:53:53,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:53:53,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:53:53,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:53:53,776 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 46 states. [2019-09-03 19:53:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:54,359 INFO L93 Difference]: Finished difference Result 333 states and 335 transitions. [2019-09-03 19:53:54,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:53:54,359 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 317 [2019-09-03 19:53:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:54,362 INFO L225 Difference]: With dead ends: 333 [2019-09-03 19:53:54,362 INFO L226 Difference]: Without dead ends: 331 [2019-09-03 19:53:54,363 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-03 19:53:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-03 19:53:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-09-03 19:53:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-03 19:53:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2019-09-03 19:53:54,376 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 317 [2019-09-03 19:53:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:54,376 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2019-09-03 19:53:54,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:53:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2019-09-03 19:53:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-03 19:53:54,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:54,377 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:54,378 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:54,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash 240906906, now seen corresponding path program 77 times [2019-09-03 19:53:54,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:54,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:54,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:54,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:56,455 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-03 19:53:56,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:56,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:56,466 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:56,612 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-09-03 19:53:56,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:56,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 19:53:56,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:59,084 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-03 19:53:59,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:59,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 123 [2019-09-03 19:53:59,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-03 19:53:59,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-03 19:53:59,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3443, Invalid=11563, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 19:53:59,089 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 123 states. [2019-09-03 19:54:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:01,669 INFO L93 Difference]: Finished difference Result 456 states and 497 transitions. [2019-09-03 19:54:01,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:54:01,670 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 324 [2019-09-03 19:54:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:01,672 INFO L225 Difference]: With dead ends: 456 [2019-09-03 19:54:01,672 INFO L226 Difference]: Without dead ends: 328 [2019-09-03 19:54:01,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5500 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6067, Invalid=20665, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 19:54:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-03 19:54:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-09-03 19:54:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-03 19:54:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2019-09-03 19:54:01,694 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 324 [2019-09-03 19:54:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:01,695 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2019-09-03 19:54:01,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-03 19:54:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2019-09-03 19:54:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-03 19:54:01,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:01,697 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:01,697 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:01,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash 797305161, now seen corresponding path program 78 times [2019-09-03 19:54:01,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:01,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:01,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:01,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:02,496 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-03 19:54:02,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:02,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:02,506 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:02,653 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-09-03 19:54:02,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:02,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:54:02,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:02,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:02,800 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-03 19:54:02,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:02,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-09-03 19:54:02,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:54:02,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:54:02,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:54:02,805 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 47 states. [2019-09-03 19:54:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:03,246 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2019-09-03 19:54:03,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:54:03,246 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 325 [2019-09-03 19:54:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:03,248 INFO L225 Difference]: With dead ends: 341 [2019-09-03 19:54:03,248 INFO L226 Difference]: Without dead ends: 339 [2019-09-03 19:54:03,249 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-03 19:54:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-03 19:54:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2019-09-03 19:54:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-03 19:54:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2019-09-03 19:54:03,261 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 325 [2019-09-03 19:54:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:03,262 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2019-09-03 19:54:03,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:54:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2019-09-03 19:54:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-03 19:54:03,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:03,264 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:03,264 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:03,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:03,265 INFO L82 PathProgramCache]: Analyzing trace with hash 268536857, now seen corresponding path program 79 times [2019-09-03 19:54:03,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:03,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:03,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:03,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:05,418 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-03 19:54:05,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:05,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:05,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:54:05,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:08,071 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-03 19:54:08,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:08,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 126 [2019-09-03 19:54:08,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-03 19:54:08,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-03 19:54:08,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3611, Invalid=12139, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 19:54:08,077 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 126 states. [2019-09-03 19:54:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:11,282 INFO L93 Difference]: Finished difference Result 467 states and 509 transitions. [2019-09-03 19:54:11,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 19:54:11,282 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 332 [2019-09-03 19:54:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:11,283 INFO L225 Difference]: With dead ends: 467 [2019-09-03 19:54:11,283 INFO L226 Difference]: Without dead ends: 336 [2019-09-03 19:54:11,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5781 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6362, Invalid=21694, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 19:54:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-03 19:54:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-03 19:54:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-03 19:54:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2019-09-03 19:54:11,297 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 332 [2019-09-03 19:54:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:11,297 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2019-09-03 19:54:11,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-03 19:54:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2019-09-03 19:54:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-03 19:54:11,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:11,298 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:11,299 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash 362636232, now seen corresponding path program 80 times [2019-09-03 19:54:11,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:11,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:11,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:12,081 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-03 19:54:12,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:12,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:12,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:12,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:12,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:12,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:54:12,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:12,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:12,297 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-03 19:54:12,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:12,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 48 [2019-09-03 19:54:12,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:54:12,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:54:12,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:54:12,302 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 48 states. [2019-09-03 19:54:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:12,801 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2019-09-03 19:54:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:54:12,801 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 333 [2019-09-03 19:54:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:12,803 INFO L225 Difference]: With dead ends: 349 [2019-09-03 19:54:12,804 INFO L226 Difference]: Without dead ends: 347 [2019-09-03 19:54:12,804 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-03 19:54:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-03 19:54:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2019-09-03 19:54:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-03 19:54:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2019-09-03 19:54:12,817 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 333 [2019-09-03 19:54:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:12,817 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2019-09-03 19:54:12,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:54:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2019-09-03 19:54:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 19:54:12,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:12,819 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:12,819 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:12,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1243747514, now seen corresponding path program 81 times [2019-09-03 19:54:12,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:12,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:12,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:15,103 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-03 19:54:15,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:15,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:15,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:15,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-03 19:54:15,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:15,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:54:15,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:17,974 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-03 19:54:17,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:17,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 129 [2019-09-03 19:54:17,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 19:54:17,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 19:54:17,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3783, Invalid=12729, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 19:54:17,981 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 129 states. [2019-09-03 19:54:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:21,448 INFO L93 Difference]: Finished difference Result 478 states and 521 transitions. [2019-09-03 19:54:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:54:21,448 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 340 [2019-09-03 19:54:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:21,450 INFO L225 Difference]: With dead ends: 478 [2019-09-03 19:54:21,450 INFO L226 Difference]: Without dead ends: 344 [2019-09-03 19:54:21,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6069 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6664, Invalid=22748, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 19:54:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-03 19:54:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-09-03 19:54:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-03 19:54:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2019-09-03 19:54:21,469 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 340 [2019-09-03 19:54:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:21,469 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2019-09-03 19:54:21,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 19:54:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2019-09-03 19:54:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-03 19:54:21,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:21,471 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:21,471 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:21,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:21,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1488899433, now seen corresponding path program 82 times [2019-09-03 19:54:21,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:21,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:21,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:21,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:22,273 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-03 19:54:22,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:22,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:22,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:22,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:22,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:22,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 19:54:22,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:22,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (83)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:54:22,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:22,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-09-03 19:54:22,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:54:22,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:54:22,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:54:22,555 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 49 states. [2019-09-03 19:54:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:23,101 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2019-09-03 19:54:23,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:54:23,101 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 341 [2019-09-03 19:54:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:23,104 INFO L225 Difference]: With dead ends: 357 [2019-09-03 19:54:23,104 INFO L226 Difference]: Without dead ends: 355 [2019-09-03 19:54:23,105 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-03 19:54:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-03 19:54:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2019-09-03 19:54:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-03 19:54:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2019-09-03 19:54:23,118 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 341 [2019-09-03 19:54:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:23,118 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2019-09-03 19:54:23,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:54:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2019-09-03 19:54:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-03 19:54:23,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:23,120 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:23,120 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:23,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:23,120 INFO L82 PathProgramCache]: Analyzing trace with hash 535151609, now seen corresponding path program 83 times [2019-09-03 19:54:23,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:23,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:23,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:23,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:23,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:25,438 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-03 19:54:25,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:25,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:25,449 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:25,599 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-03 19:54:25,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:25,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:54:25,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:28,429 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-03 19:54:28,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:28,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 132 [2019-09-03 19:54:28,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-03 19:54:28,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-03 19:54:28,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3959, Invalid=13333, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 19:54:28,436 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 132 states. [2019-09-03 19:54:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:33,740 INFO L93 Difference]: Finished difference Result 489 states and 533 transitions. [2019-09-03 19:54:33,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:54:33,740 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 348 [2019-09-03 19:54:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:33,741 INFO L225 Difference]: With dead ends: 489 [2019-09-03 19:54:33,742 INFO L226 Difference]: Without dead ends: 352 [2019-09-03 19:54:33,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6973, Invalid=23827, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 19:54:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-03 19:54:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-09-03 19:54:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-03 19:54:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 353 transitions. [2019-09-03 19:54:33,776 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 353 transitions. Word has length 348 [2019-09-03 19:54:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:33,777 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 353 transitions. [2019-09-03 19:54:33,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-03 19:54:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 353 transitions. [2019-09-03 19:54:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-03 19:54:33,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:33,780 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:33,780 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1561484712, now seen corresponding path program 84 times [2019-09-03 19:54:33,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:33,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:33,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:33,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:34,643 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-03 19:54:34,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:34,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:34,653 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:34,854 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 19:54:34,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:34,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:54:34,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:34,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:35,071 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-03 19:54:35,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:35,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2019-09-03 19:54:35,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:54:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:54:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:54:35,079 INFO L87 Difference]: Start difference. First operand 352 states and 353 transitions. Second operand 50 states. [2019-09-03 19:54:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:35,519 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2019-09-03 19:54:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:54:35,520 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 349 [2019-09-03 19:54:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:35,522 INFO L225 Difference]: With dead ends: 365 [2019-09-03 19:54:35,522 INFO L226 Difference]: Without dead ends: 363 [2019-09-03 19:54:35,523 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-03 19:54:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-03 19:54:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2019-09-03 19:54:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-03 19:54:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2019-09-03 19:54:35,536 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 349 [2019-09-03 19:54:35,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:35,536 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2019-09-03 19:54:35,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:54:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2019-09-03 19:54:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-03 19:54:35,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:35,538 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:35,538 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:35,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1641692890, now seen corresponding path program 85 times [2019-09-03 19:54:35,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:35,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:35,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:35,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:35,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:37,943 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-03 19:54:37,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:37,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:37,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:38,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 19:54:38,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:40,999 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-03 19:54:41,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:41,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 135 [2019-09-03 19:54:41,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 19:54:41,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 19:54:41,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4139, Invalid=13951, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 19:54:41,005 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 135 states. [2019-09-03 19:54:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:44,661 INFO L93 Difference]: Finished difference Result 500 states and 545 transitions. [2019-09-03 19:54:44,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 19:54:44,661 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 356 [2019-09-03 19:54:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:44,663 INFO L225 Difference]: With dead ends: 500 [2019-09-03 19:54:44,663 INFO L226 Difference]: Without dead ends: 360 [2019-09-03 19:54:44,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6666 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7289, Invalid=24931, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 19:54:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-03 19:54:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-09-03 19:54:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-03 19:54:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2019-09-03 19:54:44,683 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 356 [2019-09-03 19:54:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:44,684 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2019-09-03 19:54:44,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 19:54:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2019-09-03 19:54:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-03 19:54:44,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:44,686 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:44,686 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash -198854263, now seen corresponding path program 86 times [2019-09-03 19:54:44,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:44,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:44,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:45,583 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-03 19:54:45,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:45,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:45,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:45,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:45,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:45,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:54:45,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:45,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:45,815 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-03 19:54:45,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:45,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-09-03 19:54:45,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:54:45,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:54:45,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:54:45,819 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 51 states. [2019-09-03 19:54:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:46,313 INFO L93 Difference]: Finished difference Result 373 states and 375 transitions. [2019-09-03 19:54:46,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:54:46,314 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 357 [2019-09-03 19:54:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:46,316 INFO L225 Difference]: With dead ends: 373 [2019-09-03 19:54:46,316 INFO L226 Difference]: Without dead ends: 371 [2019-09-03 19:54:46,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1097, Invalid=1555, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-03 19:54:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2019-09-03 19:54:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-03 19:54:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2019-09-03 19:54:46,329 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 357 [2019-09-03 19:54:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:46,329 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2019-09-03 19:54:46,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:54:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2019-09-03 19:54:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-03 19:54:46,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:46,331 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:46,331 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1757219879, now seen corresponding path program 87 times [2019-09-03 19:54:46,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:46,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:46,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:48,914 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-03 19:54:48,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:48,915 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:48,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:49,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 19:54:49,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:49,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:54:49,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:52,132 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-03 19:54:52,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:52,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 138 [2019-09-03 19:54:52,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-03 19:54:52,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-03 19:54:52,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4323, Invalid=14583, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 19:54:52,138 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 138 states. [2019-09-03 19:54:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:55,975 INFO L93 Difference]: Finished difference Result 511 states and 557 transitions. [2019-09-03 19:54:55,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 19:54:55,975 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 364 [2019-09-03 19:54:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:55,978 INFO L225 Difference]: With dead ends: 511 [2019-09-03 19:54:55,978 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 19:54:55,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6975 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=7612, Invalid=26060, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 19:54:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 19:54:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-09-03 19:54:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-03 19:54:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2019-09-03 19:54:55,997 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 364 [2019-09-03 19:54:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:55,997 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2019-09-03 19:54:55,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-03 19:54:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2019-09-03 19:54:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-03 19:54:56,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:56,001 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:56,001 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1505996920, now seen corresponding path program 88 times [2019-09-03 19:54:56,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:56,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:56,973 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-03 19:54:56,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:56,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:56,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:57,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:57,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:57,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:54:57,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:57,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:57,249 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-03 19:54:57,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:57,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 52 [2019-09-03 19:54:57,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:54:57,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:54:57,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:57,254 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 52 states. [2019-09-03 19:54:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:57,704 INFO L93 Difference]: Finished difference Result 381 states and 383 transitions. [2019-09-03 19:54:57,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:54:57,704 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 365 [2019-09-03 19:54:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:57,707 INFO L225 Difference]: With dead ends: 381 [2019-09-03 19:54:57,707 INFO L226 Difference]: Without dead ends: 379 [2019-09-03 19:54:57,707 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-03 19:54:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-03 19:54:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2019-09-03 19:54:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-03 19:54:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2019-09-03 19:54:57,726 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 365 [2019-09-03 19:54:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:57,726 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2019-09-03 19:54:57,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:54:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2019-09-03 19:54:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-03 19:54:57,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:57,729 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:57,729 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:57,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash 148271354, now seen corresponding path program 89 times [2019-09-03 19:54:57,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:57,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:57,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:00,359 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-03 19:55:00,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:00,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:00,371 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:00,546 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-09-03 19:55:00,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:00,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:55:00,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:03,734 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-03 19:55:03,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:03,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 141 [2019-09-03 19:55:03,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 19:55:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 19:55:03,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4511, Invalid=15229, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 19:55:03,741 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 141 states. [2019-09-03 19:55:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:07,781 INFO L93 Difference]: Finished difference Result 522 states and 569 transitions. [2019-09-03 19:55:07,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:55:07,782 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 372 [2019-09-03 19:55:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:07,783 INFO L225 Difference]: With dead ends: 522 [2019-09-03 19:55:07,783 INFO L226 Difference]: Without dead ends: 376 [2019-09-03 19:55:07,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7291 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=7942, Invalid=27214, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 19:55:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-03 19:55:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-09-03 19:55:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-03 19:55:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2019-09-03 19:55:07,800 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 372 [2019-09-03 19:55:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:07,800 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2019-09-03 19:55:07,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 19:55:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2019-09-03 19:55:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-03 19:55:07,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:07,802 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:07,802 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:07,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:07,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1123242583, now seen corresponding path program 90 times [2019-09-03 19:55:07,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:07,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:07,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:07,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:07,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:08,778 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-03 19:55:08,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:08,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:08,789 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:08,977 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-09-03 19:55:08,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:08,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:55:08,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:08,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:09,093 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-03 19:55:09,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:09,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-09-03 19:55:09,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:55:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:55:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:55:09,099 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 53 states. [2019-09-03 19:55:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:09,664 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2019-09-03 19:55:09,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:55:09,664 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 373 [2019-09-03 19:55:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:09,666 INFO L225 Difference]: With dead ends: 389 [2019-09-03 19:55:09,666 INFO L226 Difference]: Without dead ends: 387 [2019-09-03 19:55:09,667 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-03 19:55:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-03 19:55:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-03 19:55:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-03 19:55:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2019-09-03 19:55:09,687 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 373 [2019-09-03 19:55:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:09,687 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2019-09-03 19:55:09,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:55:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2019-09-03 19:55:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-03 19:55:09,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:09,690 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:09,690 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1165550663, now seen corresponding path program 91 times [2019-09-03 19:55:09,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:09,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:09,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:12,760 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-03 19:55:12,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:12,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:12,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:12,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:55:12,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:16,222 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-03 19:55:16,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:16,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 144 [2019-09-03 19:55:16,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-03 19:55:16,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-03 19:55:16,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4703, Invalid=15889, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 19:55:16,228 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 144 states. [2019-09-03 19:55:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:20,464 INFO L93 Difference]: Finished difference Result 533 states and 581 transitions. [2019-09-03 19:55:20,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 19:55:20,464 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 380 [2019-09-03 19:55:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:20,466 INFO L225 Difference]: With dead ends: 533 [2019-09-03 19:55:20,466 INFO L226 Difference]: Without dead ends: 384 [2019-09-03 19:55:20,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7614 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8279, Invalid=28393, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 19:55:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-03 19:55:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-09-03 19:55:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-03 19:55:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2019-09-03 19:55:20,486 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 380 [2019-09-03 19:55:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:20,486 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2019-09-03 19:55:20,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-03 19:55:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2019-09-03 19:55:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-03 19:55:20,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:20,489 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:20,489 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1032403304, now seen corresponding path program 92 times [2019-09-03 19:55:20,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:20,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:21,487 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-03 19:55:21,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:21,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:21,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:21,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:21,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:21,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:55:21,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:21,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:21,799 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-03 19:55:21,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:21,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 54 [2019-09-03 19:55:21,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:55:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:55:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:55:21,804 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 54 states. [2019-09-03 19:55:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:22,373 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2019-09-03 19:55:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:55:22,373 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 381 [2019-09-03 19:55:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:22,376 INFO L225 Difference]: With dead ends: 397 [2019-09-03 19:55:22,376 INFO L226 Difference]: Without dead ends: 395 [2019-09-03 19:55:22,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:55:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-03 19:55:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-09-03 19:55:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-03 19:55:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2019-09-03 19:55:22,396 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 381 [2019-09-03 19:55:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:22,396 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2019-09-03 19:55:22,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:55:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2019-09-03 19:55:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-03 19:55:22,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:22,399 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:22,399 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1159156966, now seen corresponding path program 93 times [2019-09-03 19:55:22,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:22,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:25,334 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-03 19:55:25,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:25,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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:25,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:25,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-03 19:55:25,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:25,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:55:25,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:29,151 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-03 19:55:29,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:29,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 147 [2019-09-03 19:55:29,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-03 19:55:29,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-03 19:55:29,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=16563, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 19:55:29,158 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 147 states. [2019-09-03 19:55:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:33,547 INFO L93 Difference]: Finished difference Result 544 states and 593 transitions. [2019-09-03 19:55:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 19:55:33,553 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 388 [2019-09-03 19:55:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:33,555 INFO L225 Difference]: With dead ends: 544 [2019-09-03 19:55:33,555 INFO L226 Difference]: Without dead ends: 392 [2019-09-03 19:55:33,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7944 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=8623, Invalid=29597, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 19:55:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-03 19:55:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2019-09-03 19:55:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-03 19:55:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2019-09-03 19:55:33,578 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 388 [2019-09-03 19:55:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:33,578 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2019-09-03 19:55:33,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-03 19:55:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2019-09-03 19:55:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-03 19:55:33,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:33,581 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:33,581 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash 927312329, now seen corresponding path program 94 times [2019-09-03 19:55:33,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:33,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:33,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:34,619 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-03 19:55:34,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:34,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:34,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:34,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:34,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:34,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 19:55:34,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:34,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:34,880 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-03 19:55:34,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:34,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 55 [2019-09-03 19:55:34,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:55:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:55:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:55:34,886 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 55 states. [2019-09-03 19:55:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:35,477 INFO L93 Difference]: Finished difference Result 405 states and 407 transitions. [2019-09-03 19:55:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:55:35,478 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 389 [2019-09-03 19:55:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:35,480 INFO L225 Difference]: With dead ends: 405 [2019-09-03 19:55:35,480 INFO L226 Difference]: Without dead ends: 403 [2019-09-03 19:55:35,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:55:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-09-03 19:55:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2019-09-03 19:55:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-03 19:55:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2019-09-03 19:55:35,495 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 389 [2019-09-03 19:55:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:35,496 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2019-09-03 19:55:35,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:55:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2019-09-03 19:55:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-03 19:55:35,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:35,498 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:35,498 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1973435289, now seen corresponding path program 95 times [2019-09-03 19:55:35,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:35,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:35,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:38,472 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-03 19:55:38,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:38,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:38,486 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:38,666 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2019-09-03 19:55:38,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:38,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:55:38,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:42,216 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-03 19:55:42,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:42,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 150 [2019-09-03 19:55:42,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-03 19:55:42,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-03 19:55:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5099, Invalid=17251, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 19:55:42,223 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 150 states. [2019-09-03 19:55:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:44,955 INFO L93 Difference]: Finished difference Result 555 states and 605 transitions. [2019-09-03 19:55:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 19:55:44,955 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 396 [2019-09-03 19:55:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:44,957 INFO L225 Difference]: With dead ends: 555 [2019-09-03 19:55:44,957 INFO L226 Difference]: Without dead ends: 400 [2019-09-03 19:55:44,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8281 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=8974, Invalid=30826, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 19:55:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-03 19:55:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-03 19:55:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-03 19:55:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2019-09-03 19:55:44,974 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 396 [2019-09-03 19:55:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:44,974 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2019-09-03 19:55:44,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-03 19:55:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2019-09-03 19:55:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-03 19:55:44,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:44,976 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:44,976 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash 384244552, now seen corresponding path program 96 times [2019-09-03 19:55:44,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:44,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:44,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:46,035 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-03 19:55:46,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:46,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:46,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:46,240 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-03 19:55:46,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:46,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 19:55:46,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:46,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:46,366 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-03 19:55:46,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:46,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 56 [2019-09-03 19:55:46,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:55:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:55:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:55:46,372 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 56 states. [2019-09-03 19:55:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:46,877 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2019-09-03 19:55:46,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:55:46,878 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 397 [2019-09-03 19:55:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:46,880 INFO L225 Difference]: With dead ends: 413 [2019-09-03 19:55:46,881 INFO L226 Difference]: Without dead ends: 411 [2019-09-03 19:55:46,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:55:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-03 19:55:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2019-09-03 19:55:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-03 19:55:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2019-09-03 19:55:46,900 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 397 [2019-09-03 19:55:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:46,901 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2019-09-03 19:55:46,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:55:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2019-09-03 19:55:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-03 19:55:46,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:46,903 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:46,904 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash -597496518, now seen corresponding path program 97 times [2019-09-03 19:55:46,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:46,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:49,978 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-03 19:55:49,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:49,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:49,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:50,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 19:55:50,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:53,843 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-03 19:55:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:53,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 153 [2019-09-03 19:55:53,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-03 19:55:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-03 19:55:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5303, Invalid=17953, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 19:55:53,849 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 153 states. [2019-09-03 19:55:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:58,550 INFO L93 Difference]: Finished difference Result 566 states and 617 transitions. [2019-09-03 19:55:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 19:55:58,550 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 404 [2019-09-03 19:55:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:58,552 INFO L225 Difference]: With dead ends: 566 [2019-09-03 19:55:58,552 INFO L226 Difference]: Without dead ends: 408 [2019-09-03 19:55:58,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8625 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=9332, Invalid=32080, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 19:55:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-03 19:55:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-09-03 19:55:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-03 19:55:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2019-09-03 19:55:58,568 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 404 [2019-09-03 19:55:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:58,568 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2019-09-03 19:55:58,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-03 19:55:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2019-09-03 19:55:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-03 19:55:58,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:58,570 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:58,570 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash -819810839, now seen corresponding path program 98 times [2019-09-03 19:55:58,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:58,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:59,698 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-03 19:55:59,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:59,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:59,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:59,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:59,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:59,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 19:55:59,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:59,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:59,981 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-03 19:55:59,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:59,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-09-03 19:55:59,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:55:59,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:55:59,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=1804, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:55:59,986 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 57 states. [2019-09-03 19:56:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:00,610 INFO L93 Difference]: Finished difference Result 421 states and 423 transitions. [2019-09-03 19:56:00,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:56:00,611 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 405 [2019-09-03 19:56:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:00,613 INFO L225 Difference]: With dead ends: 421 [2019-09-03 19:56:00,613 INFO L226 Difference]: Without dead ends: 419 [2019-09-03 19:56:00,614 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-03 19:56:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-03 19:56:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2019-09-03 19:56:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-03 19:56:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2019-09-03 19:56:00,629 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 405 [2019-09-03 19:56:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:00,629 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2019-09-03 19:56:00,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:56:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2019-09-03 19:56:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-03 19:56:00,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:00,632 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:00,632 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:00,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:00,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1006392185, now seen corresponding path program 99 times [2019-09-03 19:56:00,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:00,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:00,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:00,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:00,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:03,873 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-03 19:56:03,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:03,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:03,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:04,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-09-03 19:56:04,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:04,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 19:56:04,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:08,165 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-03 19:56:08,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:08,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 156 [2019-09-03 19:56:08,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-03 19:56:08,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-03 19:56:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5511, Invalid=18669, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 19:56:08,172 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 156 states. [2019-09-03 19:56:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:12,955 INFO L93 Difference]: Finished difference Result 577 states and 629 transitions. [2019-09-03 19:56:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 19:56:12,956 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 412 [2019-09-03 19:56:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:12,959 INFO L225 Difference]: With dead ends: 577 [2019-09-03 19:56:12,960 INFO L226 Difference]: Without dead ends: 416 [2019-09-03 19:56:12,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8976 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=9697, Invalid=33359, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 19:56:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-03 19:56:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-09-03 19:56:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-03 19:56:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2019-09-03 19:56:12,980 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 412 [2019-09-03 19:56:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:12,980 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2019-09-03 19:56:12,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-03 19:56:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2019-09-03 19:56:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-03 19:56:12,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:12,982 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:12,982 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1379666648, now seen corresponding path program 100 times [2019-09-03 19:56:12,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:12,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:12,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:12,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:12,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:14,133 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-03 19:56:14,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:14,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:14,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:14,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:14,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:56:14,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:14,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:14,415 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-03 19:56:14,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:14,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 58 [2019-09-03 19:56:14,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:56:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:56:14,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:56:14,420 INFO L87 Difference]: Start difference. First operand 416 states and 417 transitions. Second operand 58 states. [2019-09-03 19:56:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:14,933 INFO L93 Difference]: Finished difference Result 429 states and 431 transitions. [2019-09-03 19:56:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:56:14,934 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 413 [2019-09-03 19:56:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:14,936 INFO L225 Difference]: With dead ends: 429 [2019-09-03 19:56:14,936 INFO L226 Difference]: Without dead ends: 427 [2019-09-03 19:56:14,937 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-03 19:56:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-03 19:56:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-09-03 19:56:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-03 19:56:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2019-09-03 19:56:14,960 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 413 [2019-09-03 19:56:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:14,960 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2019-09-03 19:56:14,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:56:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2019-09-03 19:56:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-03 19:56:14,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:14,963 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:14,963 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:14,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:14,963 INFO L82 PathProgramCache]: Analyzing trace with hash -636012710, now seen corresponding path program 101 times [2019-09-03 19:56:14,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:14,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:18,314 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-03 19:56:18,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:18,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:18,337 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:18,540 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2019-09-03 19:56:18,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:18,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 19:56:18,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:22,604 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-03 19:56:22,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:22,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 159 [2019-09-03 19:56:22,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-03 19:56:22,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-03 19:56:22,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5723, Invalid=19399, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 19:56:22,611 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 159 states. [2019-09-03 19:56:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:27,816 INFO L93 Difference]: Finished difference Result 588 states and 641 transitions. [2019-09-03 19:56:27,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 19:56:27,816 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 420 [2019-09-03 19:56:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:27,818 INFO L225 Difference]: With dead ends: 588 [2019-09-03 19:56:27,818 INFO L226 Difference]: Without dead ends: 424 [2019-09-03 19:56:27,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9334 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=10069, Invalid=34663, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 19:56:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-03 19:56:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-09-03 19:56:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-03 19:56:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2019-09-03 19:56:27,843 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 420 [2019-09-03 19:56:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:27,844 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2019-09-03 19:56:27,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-03 19:56:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2019-09-03 19:56:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-03 19:56:27,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:27,847 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:27,847 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:27,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash -109725175, now seen corresponding path program 102 times [2019-09-03 19:56:27,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:27,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:27,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:27,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:27,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:29,099 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-03 19:56:29,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:29,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:29,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:29,334 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-09-03 19:56:29,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:29,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 19:56:29,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:29,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:29,480 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-03 19:56:29,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:29,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-03 19:56:29,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:56:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:56:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:56:29,485 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 59 states. [2019-09-03 19:56:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:30,136 INFO L93 Difference]: Finished difference Result 437 states and 439 transitions. [2019-09-03 19:56:30,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:56:30,137 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 421 [2019-09-03 19:56:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:30,139 INFO L225 Difference]: With dead ends: 437 [2019-09-03 19:56:30,140 INFO L226 Difference]: Without dead ends: 435 [2019-09-03 19:56:30,140 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-03 19:56:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-03 19:56:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-09-03 19:56:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-03 19:56:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2019-09-03 19:56:30,157 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 421 [2019-09-03 19:56:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:30,157 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2019-09-03 19:56:30,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:56:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2019-09-03 19:56:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-03 19:56:30,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:30,159 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:30,159 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:30,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash -393649319, now seen corresponding path program 103 times [2019-09-03 19:56:30,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:30,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:30,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:30,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:30,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:33,665 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-03 19:56:33,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:33,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:33,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:33,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:56:33,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:37,994 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-03 19:56:37,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:37,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 162 [2019-09-03 19:56:37,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-03 19:56:37,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-03 19:56:38,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5939, Invalid=20143, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 19:56:38,000 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 162 states. [2019-09-03 19:56:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:43,222 INFO L93 Difference]: Finished difference Result 599 states and 653 transitions. [2019-09-03 19:56:43,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 19:56:43,222 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 428 [2019-09-03 19:56:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:43,223 INFO L225 Difference]: With dead ends: 599 [2019-09-03 19:56:43,224 INFO L226 Difference]: Without dead ends: 432 [2019-09-03 19:56:43,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9699 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=10448, Invalid=35992, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 19:56:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-03 19:56:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-09-03 19:56:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-03 19:56:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2019-09-03 19:56:43,249 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 428 [2019-09-03 19:56:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:43,250 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2019-09-03 19:56:43,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-03 19:56:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2019-09-03 19:56:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-03 19:56:43,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:43,252 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:43,252 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -452081912, now seen corresponding path program 104 times [2019-09-03 19:56:43,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:43,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:43,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:43,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:43,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:44,498 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-03 19:56:44,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:44,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:44,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:44,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:44,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:44,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 19:56:44,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:44,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:44,789 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-03 19:56:44,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:44,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 60 [2019-09-03 19:56:44,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:56:44,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:56:44,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:56:44,793 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 60 states. [2019-09-03 19:56:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:45,389 INFO L93 Difference]: Finished difference Result 445 states and 447 transitions. [2019-09-03 19:56:45,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:56:45,389 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 429 [2019-09-03 19:56:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:45,391 INFO L225 Difference]: With dead ends: 445 [2019-09-03 19:56:45,391 INFO L226 Difference]: Without dead ends: 443 [2019-09-03 19:56:45,391 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-03 19:56:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-03 19:56:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-03 19:56:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-03 19:56:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2019-09-03 19:56:45,413 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 429 [2019-09-03 19:56:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:45,413 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2019-09-03 19:56:45,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:56:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2019-09-03 19:56:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-03 19:56:45,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:45,416 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:45,416 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1230473594, now seen corresponding path program 105 times [2019-09-03 19:56:45,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:45,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:45,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:49,015 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-03 19:56:49,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:49,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:49,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:49,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-09-03 19:56:49,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:49,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 19:56:49,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:53,614 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-03 19:56:53,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:53,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 165 [2019-09-03 19:56:53,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-03 19:56:53,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-03 19:56:53,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6159, Invalid=20901, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 19:56:53,622 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 165 states. [2019-09-03 19:56:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:57,352 INFO L93 Difference]: Finished difference Result 610 states and 665 transitions. [2019-09-03 19:56:57,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 19:56:57,353 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 436 [2019-09-03 19:56:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:57,354 INFO L225 Difference]: With dead ends: 610 [2019-09-03 19:56:57,354 INFO L226 Difference]: Without dead ends: 440 [2019-09-03 19:56:57,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10071 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=10834, Invalid=37346, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 19:56:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-09-03 19:56:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2019-09-03 19:56:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-03 19:56:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2019-09-03 19:56:57,373 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 436 [2019-09-03 19:56:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:57,373 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2019-09-03 19:56:57,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-03 19:56:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2019-09-03 19:56:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-03 19:56:57,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:57,375 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:57,375 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1401998889, now seen corresponding path program 106 times [2019-09-03 19:56:57,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:57,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:58,688 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-03 19:56:58,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:58,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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:58,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:58,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:58,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:58,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 19:56:58,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:58,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:59,001 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-03 19:56:59,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:59,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-09-03 19:56:59,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:56:59,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:56:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:56:59,006 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 61 states. [2019-09-03 19:56:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:59,617 INFO L93 Difference]: Finished difference Result 453 states and 455 transitions. [2019-09-03 19:56:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 19:56:59,618 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 437 [2019-09-03 19:56:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:59,619 INFO L225 Difference]: With dead ends: 453 [2019-09-03 19:56:59,620 INFO L226 Difference]: Without dead ends: 451 [2019-09-03 19:56:59,620 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-03 19:56:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-03 19:56:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2019-09-03 19:56:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-03 19:56:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2019-09-03 19:56:59,636 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 437 [2019-09-03 19:56:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:59,637 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2019-09-03 19:56:59,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:56:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2019-09-03 19:56:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-03 19:56:59,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:59,639 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:59,639 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:59,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1649054919, now seen corresponding path program 107 times [2019-09-03 19:56:59,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:59,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:59,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:59,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:59,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:03,354 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-03 19:57:03,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:03,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:03,364 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:03,576 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-03 19:57:03,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:03,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 19:57:03,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:08,059 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-03 19:57:08,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:08,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 168 [2019-09-03 19:57:08,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-03 19:57:08,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-03 19:57:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6383, Invalid=21673, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 19:57:08,066 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 168 states. [2019-09-03 19:57:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:12,688 INFO L93 Difference]: Finished difference Result 621 states and 677 transitions. [2019-09-03 19:57:12,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 19:57:12,688 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 444 [2019-09-03 19:57:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:12,690 INFO L225 Difference]: With dead ends: 621 [2019-09-03 19:57:12,690 INFO L226 Difference]: Without dead ends: 448 [2019-09-03 19:57:12,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10450 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=11227, Invalid=38725, Unknown=0, NotChecked=0, Total=49952 [2019-09-03 19:57:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-03 19:57:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-09-03 19:57:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-03 19:57:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2019-09-03 19:57:12,719 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 444 [2019-09-03 19:57:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:12,720 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2019-09-03 19:57:12,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-03 19:57:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2019-09-03 19:57:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-03 19:57:12,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:12,723 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:12,723 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash -416116504, now seen corresponding path program 108 times [2019-09-03 19:57:12,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:12,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:14,038 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-03 19:57:14,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:14,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:14,047 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:14,282 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-03 19:57:14,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:14,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 19:57:14,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:14,436 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-03 19:57:14,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:14,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 62 [2019-09-03 19:57:14,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:57:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:57:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:57:14,442 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 62 states. [2019-09-03 19:57:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:15,009 INFO L93 Difference]: Finished difference Result 461 states and 463 transitions. [2019-09-03 19:57:15,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:57:15,010 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 445 [2019-09-03 19:57:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:15,011 INFO L225 Difference]: With dead ends: 461 [2019-09-03 19:57:15,012 INFO L226 Difference]: Without dead ends: 459 [2019-09-03 19:57:15,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:57:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-03 19:57:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2019-09-03 19:57:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-03 19:57:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2019-09-03 19:57:15,029 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 445 [2019-09-03 19:57:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:15,029 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2019-09-03 19:57:15,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:57:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2019-09-03 19:57:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-03 19:57:15,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:15,031 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:15,031 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:15,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 133555098, now seen corresponding path program 109 times [2019-09-03 19:57:15,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:15,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:15,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:15,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:19,033 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-03 19:57:19,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:19,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:19,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 19:57:19,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:23,792 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-03 19:57:23,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:23,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 171 [2019-09-03 19:57:23,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-03 19:57:23,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-03 19:57:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6611, Invalid=22459, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 19:57:23,800 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 171 states. [2019-09-03 19:57:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:29,733 INFO L93 Difference]: Finished difference Result 632 states and 689 transitions. [2019-09-03 19:57:29,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 19:57:29,733 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 452 [2019-09-03 19:57:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:29,734 INFO L225 Difference]: With dead ends: 632 [2019-09-03 19:57:29,734 INFO L226 Difference]: Without dead ends: 456 [2019-09-03 19:57:29,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10836 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=11627, Invalid=40129, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 19:57:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-03 19:57:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-09-03 19:57:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-03 19:57:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2019-09-03 19:57:29,753 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 452 [2019-09-03 19:57:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:29,753 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2019-09-03 19:57:29,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-03 19:57:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2019-09-03 19:57:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-03 19:57:29,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:29,755 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:29,755 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1018828215, now seen corresponding path program 110 times [2019-09-03 19:57:29,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:29,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:29,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:31,161 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-03 19:57:31,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:31,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:31,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:31,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:31,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 19:57:31,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:31,623 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-03 19:57:31,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:31,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-09-03 19:57:31,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:57:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:57:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=2185, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:57:31,628 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 63 states. [2019-09-03 19:57:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:32,188 INFO L93 Difference]: Finished difference Result 469 states and 471 transitions. [2019-09-03 19:57:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:57:32,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 453 [2019-09-03 19:57:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:32,190 INFO L225 Difference]: With dead ends: 469 [2019-09-03 19:57:32,190 INFO L226 Difference]: Without dead ends: 467 [2019-09-03 19:57:32,191 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-03 19:57:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-03 19:57:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2019-09-03 19:57:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-03 19:57:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2019-09-03 19:57:32,211 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 453 [2019-09-03 19:57:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:32,211 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2019-09-03 19:57:32,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:57:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2019-09-03 19:57:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-09-03 19:57:32,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:32,213 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:32,213 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1519490279, now seen corresponding path program 111 times [2019-09-03 19:57:32,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:32,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:32,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:36,243 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-03 19:57:36,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:36,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:36,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:36,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-03 19:57:36,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:36,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 19:57:36,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:41,298 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-03 19:57:41,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:41,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 174 [2019-09-03 19:57:41,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-03 19:57:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-03 19:57:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6843, Invalid=23259, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 19:57:41,305 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 174 states. [2019-09-03 19:57:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:47,598 INFO L93 Difference]: Finished difference Result 643 states and 701 transitions. [2019-09-03 19:57:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-03 19:57:47,608 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 460 [2019-09-03 19:57:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:47,609 INFO L225 Difference]: With dead ends: 643 [2019-09-03 19:57:47,609 INFO L226 Difference]: Without dead ends: 464 [2019-09-03 19:57:47,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11229 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=12034, Invalid=41558, Unknown=0, NotChecked=0, Total=53592 [2019-09-03 19:57:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-03 19:57:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-03 19:57:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-03 19:57:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2019-09-03 19:57:47,628 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 460 [2019-09-03 19:57:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:47,628 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2019-09-03 19:57:47,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-03 19:57:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2019-09-03 19:57:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-09-03 19:57:47,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:47,631 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:47,631 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash 102781640, now seen corresponding path program 112 times [2019-09-03 19:57:47,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:47,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:47,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:49,022 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-03 19:57:49,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:49,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:49,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:49,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:49,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 19:57:49,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:49,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:49,376 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-03 19:57:49,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:49,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 64 [2019-09-03 19:57:49,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:57:49,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:57:49,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:57:49,381 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 64 states. [2019-09-03 19:57:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:50,165 INFO L93 Difference]: Finished difference Result 477 states and 479 transitions. [2019-09-03 19:57:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:57:50,166 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 461 [2019-09-03 19:57:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:50,167 INFO L225 Difference]: With dead ends: 477 [2019-09-03 19:57:50,168 INFO L226 Difference]: Without dead ends: 475 [2019-09-03 19:57:50,168 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-03 19:57:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-03 19:57:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-09-03 19:57:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-09-03 19:57:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2019-09-03 19:57:50,186 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 461 [2019-09-03 19:57:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:50,186 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2019-09-03 19:57:50,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:57:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2019-09-03 19:57:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-03 19:57:50,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:50,188 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:50,188 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1547978170, now seen corresponding path program 113 times [2019-09-03 19:57:50,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:50,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:50,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:50,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:50,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:54,355 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-03 19:57:54,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:54,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:57:54,364 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:54,599 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2019-09-03 19:57:54,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:54,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 19:57:54,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:59,518 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-03 19:57:59,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:59,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 177 [2019-09-03 19:57:59,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-03 19:57:59,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-03 19:57:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7079, Invalid=24073, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 19:57:59,525 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 177 states. [2019-09-03 19:58:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:05,879 INFO L93 Difference]: Finished difference Result 654 states and 713 transitions. [2019-09-03 19:58:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 19:58:05,880 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 468 [2019-09-03 19:58:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:05,881 INFO L225 Difference]: With dead ends: 654 [2019-09-03 19:58:05,881 INFO L226 Difference]: Without dead ends: 472 [2019-09-03 19:58:05,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11629 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=12448, Invalid=43012, Unknown=0, NotChecked=0, Total=55460 [2019-09-03 19:58:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-03 19:58:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-03 19:58:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-03 19:58:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2019-09-03 19:58:05,901 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 468 [2019-09-03 19:58:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:05,902 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2019-09-03 19:58:05,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-03 19:58:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2019-09-03 19:58:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-03 19:58:05,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:05,903 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:05,904 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:05,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1763242391, now seen corresponding path program 114 times [2019-09-03 19:58:05,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:05,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:05,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:05,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:05,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:07,410 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-03 19:58:07,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:07,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:07,441 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:07,696 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2019-09-03 19:58:07,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:07,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:58:07,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:07,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:07,859 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-03 19:58:07,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:07,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 65 [2019-09-03 19:58:07,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:58:07,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:58:07,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:58:07,865 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 65 states. [2019-09-03 19:58:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:08,610 INFO L93 Difference]: Finished difference Result 485 states and 487 transitions. [2019-09-03 19:58:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:58:08,611 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 469 [2019-09-03 19:58:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:08,613 INFO L225 Difference]: With dead ends: 485 [2019-09-03 19:58:08,613 INFO L226 Difference]: Without dead ends: 483 [2019-09-03 19:58:08,613 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-03 19:58:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-03 19:58:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2019-09-03 19:58:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-03 19:58:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2019-09-03 19:58:08,633 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 469 [2019-09-03 19:58:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:08,634 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2019-09-03 19:58:08,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:58:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2019-09-03 19:58:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-03 19:58:08,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:08,636 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:08,636 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1361208057, now seen corresponding path program 115 times [2019-09-03 19:58:08,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:08,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:12,961 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-03 19:58:12,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:12,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:12,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:13,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 19:58:13,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:18,188 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-03 19:58:18,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:18,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 180 [2019-09-03 19:58:18,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-09-03 19:58:18,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-09-03 19:58:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7319, Invalid=24901, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 19:58:18,194 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 180 states. [2019-09-03 19:58:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:24,755 INFO L93 Difference]: Finished difference Result 665 states and 725 transitions. [2019-09-03 19:58:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 19:58:24,756 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 476 [2019-09-03 19:58:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:24,757 INFO L225 Difference]: With dead ends: 665 [2019-09-03 19:58:24,757 INFO L226 Difference]: Without dead ends: 480 [2019-09-03 19:58:24,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12036 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=12869, Invalid=44491, Unknown=0, NotChecked=0, Total=57360 [2019-09-03 19:58:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-03 19:58:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-09-03 19:58:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-03 19:58:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2019-09-03 19:58:24,785 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 476 [2019-09-03 19:58:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:24,786 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2019-09-03 19:58:24,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-09-03 19:58:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2019-09-03 19:58:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-03 19:58:24,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:24,789 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:24,789 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1689973592, now seen corresponding path program 116 times [2019-09-03 19:58:24,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:24,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:24,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:24,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:26,292 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-03 19:58:26,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:26,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:26,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:26,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:26,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:26,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 19:58:26,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:26,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:26,642 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-03 19:58:26,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:26,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 66 [2019-09-03 19:58:26,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:58:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:58:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:58:26,646 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 66 states. [2019-09-03 19:58:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:27,296 INFO L93 Difference]: Finished difference Result 493 states and 495 transitions. [2019-09-03 19:58:27,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:58:27,297 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 477 [2019-09-03 19:58:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:27,299 INFO L225 Difference]: With dead ends: 493 [2019-09-03 19:58:27,299 INFO L226 Difference]: Without dead ends: 491 [2019-09-03 19:58:27,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-03 19:58:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-03 19:58:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2019-09-03 19:58:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-03 19:58:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2019-09-03 19:58:27,318 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 477 [2019-09-03 19:58:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:27,319 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2019-09-03 19:58:27,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:58:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2019-09-03 19:58:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-03 19:58:27,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:27,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-03 19:58:27,321 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash 353677274, now seen corresponding path program 117 times [2019-09-03 19:58:27,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:27,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:27,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:27,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:27,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:31,832 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-03 19:58:31,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:31,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:31,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:32,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-09-03 19:58:32,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:32,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:58:32,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:37,380 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-03 19:58:37,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:37,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 183 [2019-09-03 19:58:37,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 183 states [2019-09-03 19:58:37,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2019-09-03 19:58:37,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7563, Invalid=25743, Unknown=0, NotChecked=0, Total=33306 [2019-09-03 19:58:37,388 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 183 states. [2019-09-03 19:58:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:42,833 INFO L93 Difference]: Finished difference Result 676 states and 737 transitions. [2019-09-03 19:58:42,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-03 19:58:42,833 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 484 [2019-09-03 19:58:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:42,834 INFO L225 Difference]: With dead ends: 676 [2019-09-03 19:58:42,835 INFO L226 Difference]: Without dead ends: 488 [2019-09-03 19:58:42,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12450 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=13297, Invalid=45995, Unknown=0, NotChecked=0, Total=59292 [2019-09-03 19:58:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-03 19:58:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-03 19:58:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-03 19:58:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2019-09-03 19:58:42,855 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 484 [2019-09-03 19:58:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:42,855 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 489 transitions. [2019-09-03 19:58:42,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 183 states. [2019-09-03 19:58:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 489 transitions. [2019-09-03 19:58:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-03 19:58:42,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:42,857 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:42,857 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:42,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1522124151, now seen corresponding path program 118 times [2019-09-03 19:58:42,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:42,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:42,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:44,412 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-03 19:58:44,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:44,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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:44,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:44,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:44,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:44,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 19:58:44,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:44,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:44,760 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-03 19:58:44,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:44,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 67 [2019-09-03 19:58:44,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:58:44,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:58:44,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:58:44,766 INFO L87 Difference]: Start difference. First operand 488 states and 489 transitions. Second operand 67 states. [2019-09-03 19:58:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:45,544 INFO L93 Difference]: Finished difference Result 501 states and 503 transitions. [2019-09-03 19:58:45,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 19:58:45,544 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 485 [2019-09-03 19:58:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:45,546 INFO L225 Difference]: With dead ends: 501 [2019-09-03 19:58:45,546 INFO L226 Difference]: Without dead ends: 499 [2019-09-03 19:58:45,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:58:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-03 19:58:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2019-09-03 19:58:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-03 19:58:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2019-09-03 19:58:45,576 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 485 [2019-09-03 19:58:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:45,576 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2019-09-03 19:58:45,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:58:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2019-09-03 19:58:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-03 19:58:45,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:45,580 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:45,580 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash -641772839, now seen corresponding path program 119 times [2019-09-03 19:58:45,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:45,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:45,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:45,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:45,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:50,222 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-03 19:58:50,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:50,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:50,246 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:50,683 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-09-03 19:58:50,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:50,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 19:58:50,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:56,156 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-03 19:58:56,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:56,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 186 [2019-09-03 19:58:56,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-09-03 19:58:56,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-09-03 19:58:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=26599, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 19:58:56,163 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 186 states. [2019-09-03 19:59:01,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:01,570 INFO L93 Difference]: Finished difference Result 687 states and 749 transitions. [2019-09-03 19:59:01,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 19:59:01,570 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 492 [2019-09-03 19:59:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:01,572 INFO L225 Difference]: With dead ends: 687 [2019-09-03 19:59:01,572 INFO L226 Difference]: Without dead ends: 496 [2019-09-03 19:59:01,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12871 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=13732, Invalid=47524, Unknown=0, NotChecked=0, Total=61256 [2019-09-03 19:59:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-03 19:59:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2019-09-03 19:59:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-03 19:59:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 497 transitions. [2019-09-03 19:59:01,595 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 497 transitions. Word has length 492 [2019-09-03 19:59:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:01,595 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 497 transitions. [2019-09-03 19:59:01,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-09-03 19:59:01,595 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 497 transitions. [2019-09-03 19:59:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-03 19:59:01,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:01,597 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:01,597 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash -410075512, now seen corresponding path program 120 times [2019-09-03 19:59:01,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:01,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:01,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:01,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:01,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:03,370 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-03 19:59:03,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:03,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:03,661 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-03 19:59:03,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:03,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 19:59:03,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:03,834 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-03 19:59:03,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:03,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 68 [2019-09-03 19:59:03,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:59:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:59:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:59:03,840 INFO L87 Difference]: Start difference. First operand 496 states and 497 transitions. Second operand 68 states. [2019-09-03 19:59:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:04,688 INFO L93 Difference]: Finished difference Result 509 states and 511 transitions. [2019-09-03 19:59:04,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:59:04,689 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 493 [2019-09-03 19:59:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:04,691 INFO L225 Difference]: With dead ends: 509 [2019-09-03 19:59:04,691 INFO L226 Difference]: Without dead ends: 507 [2019-09-03 19:59:04,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:59:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-03 19:59:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-09-03 19:59:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-03 19:59:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2019-09-03 19:59:04,713 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 493 [2019-09-03 19:59:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:04,713 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2019-09-03 19:59:04,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:59:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2019-09-03 19:59:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-03 19:59:04,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:04,715 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:04,716 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:04,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:04,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1447484934, now seen corresponding path program 121 times [2019-09-03 19:59:04,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:04,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:04,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:04,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:09,486 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-03 19:59:09,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:09,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:09,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:09,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 19:59:09,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:15,271 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-03 19:59:15,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:15,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 189 [2019-09-03 19:59:15,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 189 states [2019-09-03 19:59:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2019-09-03 19:59:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8063, Invalid=27469, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 19:59:15,279 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 189 states. [2019-09-03 19:59:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:20,785 INFO L93 Difference]: Finished difference Result 698 states and 761 transitions. [2019-09-03 19:59:20,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 19:59:20,785 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 500 [2019-09-03 19:59:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:20,787 INFO L225 Difference]: With dead ends: 698 [2019-09-03 19:59:20,787 INFO L226 Difference]: Without dead ends: 504 [2019-09-03 19:59:20,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13299 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=14174, Invalid=49078, Unknown=0, NotChecked=0, Total=63252 [2019-09-03 19:59:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-03 19:59:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-03 19:59:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-03 19:59:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2019-09-03 19:59:20,821 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 500 [2019-09-03 19:59:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:20,822 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2019-09-03 19:59:20,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 189 states. [2019-09-03 19:59:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2019-09-03 19:59:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-03 19:59:20,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:20,825 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:20,825 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:20,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1840606889, now seen corresponding path program 122 times [2019-09-03 19:59:20,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:20,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:22,506 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-03 19:59:22,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:22,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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:22,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:22,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:22,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:22,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 19:59:22,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:22,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:22,899 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-03 19:59:22,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:22,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 69 [2019-09-03 19:59:22,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:59:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:59:22,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2090, Invalid=2602, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:59:22,904 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 69 states. [2019-09-03 19:59:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:23,879 INFO L93 Difference]: Finished difference Result 517 states and 519 transitions. [2019-09-03 19:59:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:59:23,879 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 501 [2019-09-03 19:59:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:23,881 INFO L225 Difference]: With dead ends: 517 [2019-09-03 19:59:23,882 INFO L226 Difference]: Without dead ends: 515 [2019-09-03 19:59:23,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2096, Invalid=2734, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:59:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-03 19:59:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-09-03 19:59:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-03 19:59:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2019-09-03 19:59:23,903 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 501 [2019-09-03 19:59:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:23,903 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2019-09-03 19:59:23,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:59:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2019-09-03 19:59:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-03 19:59:23,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:23,905 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:23,905 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:23,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1068710585, now seen corresponding path program 123 times [2019-09-03 19:59:23,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:23,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:23,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:23,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:23,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:28,755 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-03 19:59:28,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:28,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:29,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-09-03 19:59:29,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:29,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 19:59:29,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:34,902 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-03 19:59:34,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 192 [2019-09-03 19:59:34,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-09-03 19:59:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-09-03 19:59:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8319, Invalid=28353, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 19:59:34,909 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 192 states. [2019-09-03 19:59:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:40,707 INFO L93 Difference]: Finished difference Result 709 states and 773 transitions. [2019-09-03 19:59:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 19:59:40,708 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 508 [2019-09-03 19:59:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:40,709 INFO L225 Difference]: With dead ends: 709 [2019-09-03 19:59:40,709 INFO L226 Difference]: Without dead ends: 512 [2019-09-03 19:59:40,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13734 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=14623, Invalid=50657, Unknown=0, NotChecked=0, Total=65280 [2019-09-03 19:59:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-03 19:59:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-09-03 19:59:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-03 19:59:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2019-09-03 19:59:40,743 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 508 [2019-09-03 19:59:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:40,744 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2019-09-03 19:59:40,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-09-03 19:59:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2019-09-03 19:59:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-03 19:59:40,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:40,747 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:40,747 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash -211064728, now seen corresponding path program 124 times [2019-09-03 19:59:40,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:40,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:40,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:42,551 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-03 19:59:42,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:42,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:42,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:42,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:42,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:42,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 19:59:42,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:42,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:42,914 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-03 19:59:42,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:42,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 70 [2019-09-03 19:59:42,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:59:42,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:59:42,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:59:42,920 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 70 states. [2019-09-03 19:59:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:43,901 INFO L93 Difference]: Finished difference Result 525 states and 527 transitions. [2019-09-03 19:59:43,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:59:43,901 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 509 [2019-09-03 19:59:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:43,903 INFO L225 Difference]: With dead ends: 525 [2019-09-03 19:59:43,903 INFO L226 Difference]: Without dead ends: 523 [2019-09-03 19:59:43,904 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-03 19:59:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-03 19:59:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2019-09-03 19:59:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-03 19:59:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2019-09-03 19:59:43,935 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 509 [2019-09-03 19:59:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:43,936 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2019-09-03 19:59:43,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:59:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2019-09-03 19:59:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-03 19:59:43,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:43,939 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:43,939 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1510186010, now seen corresponding path program 125 times [2019-09-03 19:59:43,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:43,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:43,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:43,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:48,999 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-03 19:59:49,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:49,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:49,011 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:49,280 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 64 check-sat command(s) [2019-09-03 19:59:49,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:49,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 19:59:49,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:55,292 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-03 19:59:55,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:55,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 195 [2019-09-03 19:59:55,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 195 states [2019-09-03 19:59:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2019-09-03 19:59:55,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8579, Invalid=29251, Unknown=0, NotChecked=0, Total=37830 [2019-09-03 19:59:55,301 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 195 states. [2019-09-03 20:00:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:01,174 INFO L93 Difference]: Finished difference Result 720 states and 785 transitions. [2019-09-03 20:00:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 20:00:01,174 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 516 [2019-09-03 20:00:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:01,176 INFO L225 Difference]: With dead ends: 720 [2019-09-03 20:00:01,176 INFO L226 Difference]: Without dead ends: 520 [2019-09-03 20:00:01,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14176 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=15079, Invalid=52261, Unknown=0, NotChecked=0, Total=67340 [2019-09-03 20:00:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-03 20:00:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2019-09-03 20:00:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-03 20:00:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2019-09-03 20:00:01,213 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 516 [2019-09-03 20:00:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:01,214 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2019-09-03 20:00:01,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 195 states. [2019-09-03 20:00:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2019-09-03 20:00:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-09-03 20:00:01,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:01,217 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:01,218 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash 939961033, now seen corresponding path program 126 times [2019-09-03 20:00:01,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:01,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:01,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:03,082 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-03 20:00:03,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:03,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:03,094 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:00:03,396 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 64 check-sat command(s) [2019-09-03 20:00:03,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:03,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-03 20:00:03,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2232 proven. 6145 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (127)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:00:03,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:03,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 71] total 72 [2019-09-03 20:00:03,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:00:03,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:00:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2223, Invalid=2889, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:00:03,916 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 72 states. [2019-09-03 20:00:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:04,802 INFO L93 Difference]: Finished difference Result 529 states and 530 transitions. [2019-09-03 20:00:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:00:04,802 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 517 [2019-09-03 20:00:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:04,804 INFO L225 Difference]: With dead ends: 529 [2019-09-03 20:00:04,805 INFO L226 Difference]: Without dead ends: 527 [2019-09-03 20:00:04,805 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-03 20:00:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-03 20:00:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-03 20:00:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-03 20:00:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2019-09-03 20:00:04,828 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 517 [2019-09-03 20:00:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:04,829 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2019-09-03 20:00:04,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:00:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2019-09-03 20:00:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-03 20:00:04,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:04,831 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:04,832 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 720116377, now seen corresponding path program 127 times [2019-09-03 20:00:04,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:04,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:04,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:10,014 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-03 20:00:10,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:10,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:10,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 20:00:10,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:16,351 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-03 20:00:16,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:16,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 198 [2019-09-03 20:00:16,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-09-03 20:00:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-09-03 20:00:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8843, Invalid=30163, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 20:00:16,359 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 198 states. [2019-09-03 20:00:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:22,454 INFO L93 Difference]: Finished difference Result 731 states and 797 transitions. [2019-09-03 20:00:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-03 20:00:22,455 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 524 [2019-09-03 20:00:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:22,456 INFO L225 Difference]: With dead ends: 731 [2019-09-03 20:00:22,456 INFO L226 Difference]: Without dead ends: 528 [2019-09-03 20:00:22,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14625 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15542, Invalid=53890, Unknown=0, NotChecked=0, Total=69432 [2019-09-03 20:00:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-03 20:00:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-09-03 20:00:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-03 20:00:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2019-09-03 20:00:22,493 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 524 [2019-09-03 20:00:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:22,494 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2019-09-03 20:00:22,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-09-03 20:00:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2019-09-03 20:00:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-03 20:00:22,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:22,498 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:22,498 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:22,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1858669128, now seen corresponding path program 128 times [2019-09-03 20:00:22,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:22,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:22,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:24,371 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-03 20:00:24,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:24,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:24,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:24,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:24,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:24,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-03 20:00:24,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:24,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:24,880 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-03 20:00:24,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:24,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 72] total 73 [2019-09-03 20:00:24,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:00:24,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:00:24,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2290, Invalid=2966, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:00:24,886 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 73 states. [2019-09-03 20:00:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:25,865 INFO L93 Difference]: Finished difference Result 537 states and 538 transitions. [2019-09-03 20:00:25,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 20:00:25,865 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 525 [2019-09-03 20:00:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:25,867 INFO L225 Difference]: With dead ends: 537 [2019-09-03 20:00:25,867 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 20:00:25,868 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-03 20:00:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 20:00:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2019-09-03 20:00:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-03 20:00:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2019-09-03 20:00:25,889 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 525 [2019-09-03 20:00:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:25,890 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2019-09-03 20:00:25,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:00:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2019-09-03 20:00:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-09-03 20:00:25,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:25,892 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:25,892 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:25,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1313218106, now seen corresponding path program 129 times [2019-09-03 20:00:25,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:25,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:25,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:25,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:25,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:31,172 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-03 20:00:31,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:31,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:31,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:31,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-03 20:00:31,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:31,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-03 20:00:31,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:37,985 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-03 20:00:37,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:37,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 201 [2019-09-03 20:00:37,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 201 states [2019-09-03 20:00:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2019-09-03 20:00:37,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9111, Invalid=31089, Unknown=0, NotChecked=0, Total=40200 [2019-09-03 20:00:37,996 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 201 states. [2019-09-03 20:00:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:44,074 INFO L93 Difference]: Finished difference Result 742 states and 809 transitions. [2019-09-03 20:00:44,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-03 20:00:44,075 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 532 [2019-09-03 20:00:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:44,076 INFO L225 Difference]: With dead ends: 742 [2019-09-03 20:00:44,076 INFO L226 Difference]: Without dead ends: 536 [2019-09-03 20:00:44,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15081 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=16012, Invalid=55544, Unknown=0, NotChecked=0, Total=71556 [2019-09-03 20:00:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-03 20:00:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-09-03 20:00:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-09-03 20:00:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2019-09-03 20:00:44,116 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 532 [2019-09-03 20:00:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:44,117 INFO L475 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2019-09-03 20:00:44,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 201 states. [2019-09-03 20:00:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2019-09-03 20:00:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-09-03 20:00:44,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:44,121 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:44,121 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:44,121 INFO L82 PathProgramCache]: Analyzing trace with hash 881585897, now seen corresponding path program 130 times [2019-09-03 20:00:44,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:44,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:44,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:44,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:44,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:46,048 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-03 20:00:46,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:46,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:46,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:46,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:46,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:46,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 20:00:46,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:46,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:46,516 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-03 20:00:46,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:46,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 73] total 74 [2019-09-03 20:00:46,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 20:00:46,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 20:00:46,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2358, Invalid=3044, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:00:46,522 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 74 states. [2019-09-03 20:00:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:47,554 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2019-09-03 20:00:47,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:00:47,555 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 533 [2019-09-03 20:00:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:47,556 INFO L225 Difference]: With dead ends: 545 [2019-09-03 20:00:47,556 INFO L226 Difference]: Without dead ends: 543 [2019-09-03 20:00:47,557 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-03 20:00:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-03 20:00:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-09-03 20:00:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-03 20:00:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2019-09-03 20:00:47,579 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 533 [2019-09-03 20:00:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:47,579 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2019-09-03 20:00:47,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 20:00:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2019-09-03 20:00:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-09-03 20:00:47,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:47,582 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:47,582 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:47,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:47,582 INFO L82 PathProgramCache]: Analyzing trace with hash -891817351, now seen corresponding path program 131 times [2019-09-03 20:00:47,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:47,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:47,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:47,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:53,022 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-03 20:00:53,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:53,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:53,049 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:53,339 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2019-09-03 20:00:53,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:53,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-03 20:00:53,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:59,838 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-03 20:00:59,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:59,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 204 [2019-09-03 20:00:59,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 204 states [2019-09-03 20:00:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2019-09-03 20:00:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9383, Invalid=32029, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 20:00:59,847 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 204 states. [2019-09-03 20:01:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:06,397 INFO L93 Difference]: Finished difference Result 753 states and 821 transitions. [2019-09-03 20:01:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-03 20:01:06,397 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 540 [2019-09-03 20:01:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:06,398 INFO L225 Difference]: With dead ends: 753 [2019-09-03 20:01:06,398 INFO L226 Difference]: Without dead ends: 544 [2019-09-03 20:01:06,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15544 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=16489, Invalid=57223, Unknown=0, NotChecked=0, Total=73712 [2019-09-03 20:01:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-03 20:01:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-09-03 20:01:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-03 20:01:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2019-09-03 20:01:06,423 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 540 [2019-09-03 20:01:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:06,423 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2019-09-03 20:01:06,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 204 states. [2019-09-03 20:01:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2019-09-03 20:01:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-09-03 20:01:06,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:06,425 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:06,425 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:06,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1860852696, now seen corresponding path program 132 times [2019-09-03 20:01:06,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:06,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:06,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:08,392 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-03 20:01:08,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:08,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:08,403 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:08,721 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-03 20:01:08,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:08,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-03 20:01:08,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:08,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:09,000 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-03 20:01:09,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:09,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 74] total 75 [2019-09-03 20:01:09,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:01:09,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:01:09,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2427, Invalid=3123, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:01:09,006 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 75 states. [2019-09-03 20:01:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:10,047 INFO L93 Difference]: Finished difference Result 553 states and 554 transitions. [2019-09-03 20:01:10,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 20:01:10,048 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 541 [2019-09-03 20:01:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:10,050 INFO L225 Difference]: With dead ends: 553 [2019-09-03 20:01:10,050 INFO L226 Difference]: Without dead ends: 551 [2019-09-03 20:01:10,050 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-03 20:01:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-03 20:01:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-03 20:01:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-03 20:01:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2019-09-03 20:01:10,072 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 541 [2019-09-03 20:01:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:10,072 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2019-09-03 20:01:10,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:01:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2019-09-03 20:01:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-03 20:01:10,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:10,075 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:10,075 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1219319718, now seen corresponding path program 133 times [2019-09-03 20:01:10,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:10,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:10,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:10,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:10,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:15,747 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-03 20:01:15,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:15,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:15,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:15,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-03 20:01:15,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:22,718 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-03 20:01:22,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:22,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 207 [2019-09-03 20:01:22,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 207 states [2019-09-03 20:01:22,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2019-09-03 20:01:22,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9659, Invalid=32983, Unknown=0, NotChecked=0, Total=42642 [2019-09-03 20:01:22,725 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 207 states. [2019-09-03 20:01:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:29,474 INFO L93 Difference]: Finished difference Result 764 states and 833 transitions. [2019-09-03 20:01:29,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 20:01:29,474 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 548 [2019-09-03 20:01:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:29,476 INFO L225 Difference]: With dead ends: 764 [2019-09-03 20:01:29,476 INFO L226 Difference]: Without dead ends: 552 [2019-09-03 20:01:29,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16014 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=16973, Invalid=58927, Unknown=0, NotChecked=0, Total=75900 [2019-09-03 20:01:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-03 20:01:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-09-03 20:01:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-03 20:01:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 553 transitions. [2019-09-03 20:01:29,518 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 553 transitions. Word has length 548 [2019-09-03 20:01:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:29,519 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 553 transitions. [2019-09-03 20:01:29,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 207 states. [2019-09-03 20:01:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 553 transitions. [2019-09-03 20:01:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-03 20:01:29,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:29,523 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:29,523 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:29,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:29,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1676199159, now seen corresponding path program 134 times [2019-09-03 20:01:29,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:29,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:29,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:31,589 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-03 20:01:31,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:31,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:31,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:01:31,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:31,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:31,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-03 20:01:31,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:31,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:32,059 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-03 20:01:32,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:32,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 75] total 76 [2019-09-03 20:01:32,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:01:32,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:01:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2497, Invalid=3203, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:01:32,065 INFO L87 Difference]: Start difference. First operand 552 states and 553 transitions. Second operand 76 states. [2019-09-03 20:01:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:33,218 INFO L93 Difference]: Finished difference Result 561 states and 562 transitions. [2019-09-03 20:01:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:01:33,218 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 549 [2019-09-03 20:01:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:33,220 INFO L225 Difference]: With dead ends: 561 [2019-09-03 20:01:33,221 INFO L226 Difference]: Without dead ends: 559 [2019-09-03 20:01:33,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 613 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2510, Invalid=3496, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:01:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-03 20:01:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-03 20:01:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-03 20:01:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2019-09-03 20:01:33,245 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 549 [2019-09-03 20:01:33,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:33,246 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2019-09-03 20:01:33,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 20:01:33,246 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2019-09-03 20:01:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-03 20:01:33,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:33,250 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:33,250 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:33,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:33,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1234910631, now seen corresponding path program 135 times [2019-09-03 20:01:33,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:33,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:33,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:39,030 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-03 20:01:39,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:39,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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:39,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:01:39,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-03 20:01:39,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:39,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 20:01:39,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:46,411 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-03 20:01:46,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:46,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 210 [2019-09-03 20:01:46,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 210 states [2019-09-03 20:01:46,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2019-09-03 20:01:46,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9939, Invalid=33951, Unknown=0, NotChecked=0, Total=43890 [2019-09-03 20:01:46,420 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 210 states. [2019-09-03 20:01:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:53,583 INFO L93 Difference]: Finished difference Result 775 states and 845 transitions. [2019-09-03 20:01:53,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-03 20:01:53,584 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 556 [2019-09-03 20:01:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:53,585 INFO L225 Difference]: With dead ends: 775 [2019-09-03 20:01:53,585 INFO L226 Difference]: Without dead ends: 560 [2019-09-03 20:01:53,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16491 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=17464, Invalid=60656, Unknown=0, NotChecked=0, Total=78120 [2019-09-03 20:01:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-03 20:01:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-03 20:01:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-03 20:01:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2019-09-03 20:01:53,611 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 556 [2019-09-03 20:01:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:53,611 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2019-09-03 20:01:53,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 210 states. [2019-09-03 20:01:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2019-09-03 20:01:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-03 20:01:53,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:53,613 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:53,613 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:53,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash -113297912, now seen corresponding path program 136 times [2019-09-03 20:01:53,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:53,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:53,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:53,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:53,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:55,652 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-03 20:01:55,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:55,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:55,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:01:55,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:01:55,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:55,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-03 20:01:55,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:55,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:56,149 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-03 20:01:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:56,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 76] total 77 [2019-09-03 20:01:56,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:01:56,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:01:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2568, Invalid=3284, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:01:56,155 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 77 states. [2019-09-03 20:01:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:57,145 INFO L93 Difference]: Finished difference Result 569 states and 570 transitions. [2019-09-03 20:01:57,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 20:01:57,146 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 557 [2019-09-03 20:01:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:57,148 INFO L225 Difference]: With dead ends: 569 [2019-09-03 20:01:57,148 INFO L226 Difference]: Without dead ends: 567 [2019-09-03 20:01:57,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 622 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2581, Invalid=3581, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:01:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-03 20:01:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-03 20:01:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-03 20:01:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2019-09-03 20:01:57,178 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 557 [2019-09-03 20:01:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:57,178 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2019-09-03 20:01:57,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:01:57,178 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2019-09-03 20:01:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-09-03 20:01:57,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:57,182 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:57,182 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash -293913990, now seen corresponding path program 137 times [2019-09-03 20:01:57,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:57,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:57,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:57,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:57,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:03,153 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-03 20:02:03,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:03,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:03,164 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:02:03,487 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 70 check-sat command(s) [2019-09-03 20:02:03,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:03,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-03 20:02:03,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:10,645 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-03 20:02:10,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:10,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 213 [2019-09-03 20:02:10,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 213 states [2019-09-03 20:02:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2019-09-03 20:02:10,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10223, Invalid=34933, Unknown=0, NotChecked=0, Total=45156 [2019-09-03 20:02:10,655 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 213 states. [2019-09-03 20:02:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:19,985 INFO L93 Difference]: Finished difference Result 786 states and 857 transitions. [2019-09-03 20:02:19,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 20:02:19,986 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 564 [2019-09-03 20:02:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:19,987 INFO L225 Difference]: With dead ends: 786 [2019-09-03 20:02:19,987 INFO L226 Difference]: Without dead ends: 568 [2019-09-03 20:02:19,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16975 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=17962, Invalid=62410, Unknown=0, NotChecked=0, Total=80372 [2019-09-03 20:02:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-03 20:02:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-03 20:02:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-03 20:02:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 569 transitions. [2019-09-03 20:02:20,014 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 569 transitions. Word has length 564 [2019-09-03 20:02:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:20,014 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 569 transitions. [2019-09-03 20:02:20,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 213 states. [2019-09-03 20:02:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 569 transitions. [2019-09-03 20:02:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-03 20:02:20,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:20,016 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:20,016 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash -805662935, now seen corresponding path program 138 times [2019-09-03 20:02:20,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:20,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:20,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:22,090 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-03 20:02:22,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:22,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:22,128 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:02:22,466 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 70 check-sat command(s) [2019-09-03 20:02:22,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:22,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-03 20:02:22,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:22,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:22,754 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-03 20:02:22,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:22,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 77] total 78 [2019-09-03 20:02:22,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:02:22,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:02:22,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=3366, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:02:22,761 INFO L87 Difference]: Start difference. First operand 568 states and 569 transitions. Second operand 78 states. [2019-09-03 20:02:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:23,646 INFO L93 Difference]: Finished difference Result 577 states and 578 transitions. [2019-09-03 20:02:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:02:23,646 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 565 [2019-09-03 20:02:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:23,648 INFO L225 Difference]: With dead ends: 577 [2019-09-03 20:02:23,648 INFO L226 Difference]: Without dead ends: 575 [2019-09-03 20:02:23,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 631 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2653, Invalid=3667, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:02:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-03 20:02:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-09-03 20:02:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-03 20:02:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2019-09-03 20:02:23,675 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 565 [2019-09-03 20:02:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:23,675 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2019-09-03 20:02:23,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:02:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2019-09-03 20:02:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-09-03 20:02:23,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:23,679 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:23,679 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash -872379847, now seen corresponding path program 139 times [2019-09-03 20:02:23,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:23,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:23,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:23,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:29,813 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-03 20:02:29,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:29,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:29,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:30,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-03 20:02:30,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:37,285 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-03 20:02:37,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:37,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 216 [2019-09-03 20:02:37,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 216 states [2019-09-03 20:02:37,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2019-09-03 20:02:37,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10511, Invalid=35929, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 20:02:37,293 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 216 states. [2019-09-03 20:02:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:47,339 INFO L93 Difference]: Finished difference Result 797 states and 869 transitions. [2019-09-03 20:02:47,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-03 20:02:47,339 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 572 [2019-09-03 20:02:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:47,341 INFO L225 Difference]: With dead ends: 797 [2019-09-03 20:02:47,341 INFO L226 Difference]: Without dead ends: 576 [2019-09-03 20:02:47,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17466 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=18467, Invalid=64189, Unknown=0, NotChecked=0, Total=82656 [2019-09-03 20:02:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-03 20:02:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-03 20:02:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-03 20:02:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 577 transitions. [2019-09-03 20:02:47,383 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 577 transitions. Word has length 572 [2019-09-03 20:02:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:47,384 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 577 transitions. [2019-09-03 20:02:47,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 216 states. [2019-09-03 20:02:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 577 transitions. [2019-09-03 20:02:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-09-03 20:02:47,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:47,388 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:47,388 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1917599768, now seen corresponding path program 140 times [2019-09-03 20:02:47,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:47,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:47,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:49,647 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-03 20:02:49,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:49,647 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:49,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:49,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:49,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:49,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 20:02:49,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:49,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:50,143 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-03 20:02:50,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:50,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 78] total 79 [2019-09-03 20:02:50,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:02:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:02:50,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2713, Invalid=3449, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:02:50,149 INFO L87 Difference]: Start difference. First operand 576 states and 577 transitions. Second operand 79 states. [2019-09-03 20:02:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:51,015 INFO L93 Difference]: Finished difference Result 585 states and 586 transitions. [2019-09-03 20:02:51,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 20:02:51,015 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 573 [2019-09-03 20:02:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:51,017 INFO L225 Difference]: With dead ends: 585 [2019-09-03 20:02:51,017 INFO L226 Difference]: Without dead ends: 583 [2019-09-03 20:02:51,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2726, Invalid=3754, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:02:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-03 20:02:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-03 20:02:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-03 20:02:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2019-09-03 20:02:51,048 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 573 [2019-09-03 20:02:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:51,048 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2019-09-03 20:02:51,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:02:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2019-09-03 20:02:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-09-03 20:02:51,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:51,051 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:51,051 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:51,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1785604966, now seen corresponding path program 141 times [2019-09-03 20:02:51,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:51,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:51,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:51,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:57,363 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-03 20:02:57,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:57,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:57,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:57,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-09-03 20:02:57,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:57,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-03 20:02:57,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:05,371 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-03 20:03:05,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:05,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 219 [2019-09-03 20:03:05,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 219 states [2019-09-03 20:03:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2019-09-03 20:03:05,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10803, Invalid=36939, Unknown=0, NotChecked=0, Total=47742 [2019-09-03 20:03:05,382 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 219 states. [2019-09-03 20:03:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:15,588 INFO L93 Difference]: Finished difference Result 808 states and 881 transitions. [2019-09-03 20:03:15,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-03 20:03:15,589 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 580 [2019-09-03 20:03:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:15,590 INFO L225 Difference]: With dead ends: 808 [2019-09-03 20:03:15,590 INFO L226 Difference]: Without dead ends: 584 [2019-09-03 20:03:15,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17964 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=18979, Invalid=65993, Unknown=0, NotChecked=0, Total=84972 [2019-09-03 20:03:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-03 20:03:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-03 20:03:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-03 20:03:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 585 transitions. [2019-09-03 20:03:15,623 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 585 transitions. Word has length 580 [2019-09-03 20:03:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:15,623 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 585 transitions. [2019-09-03 20:03:15,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 219 states. [2019-09-03 20:03:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 585 transitions. [2019-09-03 20:03:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-09-03 20:03:15,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:15,626 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:15,626 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:15,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2047339337, now seen corresponding path program 142 times [2019-09-03 20:03:15,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:15,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:15,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:15,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:15,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:17,899 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-03 20:03:17,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:17,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:17,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:03:18,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:03:18,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:18,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-03 20:03:18,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:18,426 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-03 20:03:18,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:18,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 79] total 80 [2019-09-03 20:03:18,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 20:03:18,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 20:03:18,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2787, Invalid=3533, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:03:18,432 INFO L87 Difference]: Start difference. First operand 584 states and 585 transitions. Second operand 80 states. [2019-09-03 20:03:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:19,445 INFO L93 Difference]: Finished difference Result 593 states and 594 transitions. [2019-09-03 20:03:19,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:03:19,446 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 581 [2019-09-03 20:03:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:19,448 INFO L225 Difference]: With dead ends: 593 [2019-09-03 20:03:19,448 INFO L226 Difference]: Without dead ends: 591 [2019-09-03 20:03:19,449 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-03 20:03:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-03 20:03:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-03 20:03:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-03 20:03:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2019-09-03 20:03:19,473 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 581 [2019-09-03 20:03:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:19,474 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2019-09-03 20:03:19,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 20:03:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2019-09-03 20:03:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2019-09-03 20:03:19,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:19,476 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:19,477 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 295258649, now seen corresponding path program 143 times [2019-09-03 20:03:19,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:19,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:19,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:25,971 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-03 20:03:25,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:25,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:25,981 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:03:26,325 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2019-09-03 20:03:26,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:26,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-03 20:03:26,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:34,769 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-03 20:03:34,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:34,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 222 [2019-09-03 20:03:34,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 222 states [2019-09-03 20:03:34,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2019-09-03 20:03:34,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11099, Invalid=37963, Unknown=0, NotChecked=0, Total=49062 [2019-09-03 20:03:34,779 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 222 states.