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/half_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:50:05,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:50:05,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:50:06,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:50:06,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:50:06,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:50:06,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:50:06,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:50:06,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:50:06,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:50:06,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:50:06,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:50:06,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:50:06,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:50:06,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:50:06,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:50:06,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:50:06,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:50:06,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:50:06,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:50:06,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:50:06,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:50:06,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:50:06,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:50:06,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:50:06,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:50:06,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:50:06,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:50:06,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:50:06,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:50:06,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:50:06,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:50:06,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:50:06,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:50:06,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:50:06,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:50:06,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:50:06,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:50:06,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:50:06,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:50:06,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:50:06,044 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:50:06,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:50:06,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:50:06,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:50:06,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:50:06,059 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:50:06,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:50:06,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:50:06,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:50:06,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:50:06,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:50:06,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:50:06,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:50:06,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:50:06,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:50:06,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:50:06,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:50:06,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:50:06,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:50:06,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:50:06,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:50:06,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:50:06,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:50:06,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:50:06,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:50:06,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:50:06,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:50:06,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:50:06,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:50:06,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:50:06,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:50:06,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:50:06,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:50:06,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:50:06,108 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:50:06,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2.i [2019-09-03 19:50:06,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53f82e54/39b6f0a9836642569e2356d40bf26e3a/FLAG210b3ec68 [2019-09-03 19:50:06,556 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:50:06,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i [2019-09-03 19:50:06,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53f82e54/39b6f0a9836642569e2356d40bf26e3a/FLAG210b3ec68 [2019-09-03 19:50:06,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53f82e54/39b6f0a9836642569e2356d40bf26e3a [2019-09-03 19:50:06,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:50:06,948 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:50:06,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:06,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:50:06,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:50:06,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:06" (1/1) ... [2019-09-03 19:50:06,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c831cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:06, skipping insertion in model container [2019-09-03 19:50:06,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:06" (1/1) ... [2019-09-03 19:50:06,964 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:50:06,984 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:50:07,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:07,185 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:50:07,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:07,211 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:50:07,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07 WrapperNode [2019-09-03 19:50:07,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:07,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:50:07,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:50:07,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:50:07,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (1/1) ... [2019-09-03 19:50:07,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (1/1) ... [2019-09-03 19:50:07,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (1/1) ... [2019-09-03 19:50:07,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (1/1) ... [2019-09-03 19:50:07,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (1/1) ... [2019-09-03 19:50:07,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (1/1) ... [2019-09-03 19:50:07,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (1/1) ... [2019-09-03 19:50:07,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:50:07,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:50:07,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:50:07,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:50:07,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (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:50:07,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:50:07,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:50:07,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:50:07,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:50:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:50:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:50:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:50:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:50:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:50:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:50:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:50:07,560 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:50:07,560 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:50:07,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:07 BoogieIcfgContainer [2019-09-03 19:50:07,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:50:07,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:50:07,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:50:07,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:50:07,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:50:06" (1/3) ... [2019-09-03 19:50:07,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aab0206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:07, skipping insertion in model container [2019-09-03 19:50:07,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:07" (2/3) ... [2019-09-03 19:50:07,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aab0206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:07, skipping insertion in model container [2019-09-03 19:50:07,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:07" (3/3) ... [2019-09-03 19:50:07,569 INFO L109 eAbstractionObserver]: Analyzing ICFG half_2.i [2019-09-03 19:50:07,579 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:50:07,585 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:50:07,599 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:50:07,626 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:50:07,627 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:50:07,627 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:50:07,627 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:50:07,628 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:50:07,628 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:50:07,628 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:50:07,628 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:50:07,628 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:50:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-03 19:50:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:50:07,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:07,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:07,651 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:07,657 INFO L82 PathProgramCache]: Analyzing trace with hash -351980134, now seen corresponding path program 1 times [2019-09-03 19:50:07,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:07,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:07,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:07,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:07,756 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:50:07,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:07,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:50:07,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:50:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:50:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:50:07,779 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-03 19:50:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:07,797 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-09-03 19:50:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:50:07,798 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-03 19:50:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:07,804 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:50:07,804 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:50:07,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:50:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:50:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:50:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:50:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 19:50:07,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2019-09-03 19:50:07,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:07,841 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 19:50:07,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:50:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 19:50:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:50:07,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:07,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:07,843 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 392972438, now seen corresponding path program 1 times [2019-09-03 19:50:07,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:07,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:07,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,083 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:50:08,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:08,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:50:08,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:50:08,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:50:08,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:08,086 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-09-03 19:50:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:08,244 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-03 19:50:08,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:50:08,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 19:50:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:08,245 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:50:08,246 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:50:08,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:50:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:50:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 19:50:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 19:50:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-03 19:50:08,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-03 19:50:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:08,254 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-03 19:50:08,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:50:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-03 19:50:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:50:08,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:08,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:08,256 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:08,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:08,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1474350191, now seen corresponding path program 1 times [2019-09-03 19:50:08,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:08,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:08,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:08,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:08,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:08,376 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:50:08,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:50:08,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:08,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:08,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:08,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:08,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:08,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:08,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-09-03 19:50:08,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:50:08,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:50:08,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:50:08,558 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 11 states. [2019-09-03 19:50:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:08,710 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-03 19:50:08,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:50:08,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-09-03 19:50:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:08,711 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:50:08,711 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:50:08,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:50:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:50:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 19:50:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:50:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-03 19:50:08,717 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2019-09-03 19:50:08,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:08,717 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-03 19:50:08,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:50:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-03 19:50:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:50:08,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:08,719 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:08,719 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:08,720 INFO L82 PathProgramCache]: Analyzing trace with hash 637322166, now seen corresponding path program 2 times [2019-09-03 19:50:08,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:08,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:08,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:08,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:08,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:08,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:08,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:08,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:50:08,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:08,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:08,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:08,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-03 19:50:08,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:50:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:50:08,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:50:08,901 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2019-09-03 19:50:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:08,995 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-03 19:50:08,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:50:08,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-09-03 19:50:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:08,998 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:50:08,998 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:50:08,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:50:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:50:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-09-03 19:50:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:50:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-03 19:50:09,018 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-09-03 19:50:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:09,018 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-03 19:50:09,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:50:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-03 19:50:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:50:09,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:09,019 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:09,020 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash 326029073, now seen corresponding path program 1 times [2019-09-03 19:50:09,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:09,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:09,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:09,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:09,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:09,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:09,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:09,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:09,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:50:09,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:09,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:09,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:09,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:09,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:09,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:09,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2019-09-03 19:50:09,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:50:09,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:50:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:50:09,498 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 18 states. [2019-09-03 19:50:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:09,797 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-09-03 19:50:09,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:50:09,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-09-03 19:50:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:09,801 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:50:09,801 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:50:09,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:50:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:50:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 19:50:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:50:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-09-03 19:50:09,808 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2019-09-03 19:50:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:09,808 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-09-03 19:50:09,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:50:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-09-03 19:50:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:50:09,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:09,810 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:09,810 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:09,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1130459304, now seen corresponding path program 2 times [2019-09-03 19:50:09,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:09,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:09,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:09,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:09,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:09,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:09,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:09,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:09,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:09,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:09,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:50:09,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:10,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:10,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:10,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-03 19:50:10,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:50:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:50:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:50:10,045 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-09-03 19:50:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:10,196 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-03 19:50:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:50:10,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-09-03 19:50:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:10,197 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:50:10,197 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:50:10,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:50:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:50:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-09-03 19:50:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:50:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-03 19:50:10,205 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2019-09-03 19:50:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:10,205 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-03 19:50:10,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:50:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-03 19:50:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:50:10,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:10,206 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:10,207 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1086392623, now seen corresponding path program 3 times [2019-09-03 19:50:10,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:10,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:50:10,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:10,433 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:50:10,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:10,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:50:10,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:10,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:50:10,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:10,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:10,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:10,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:10,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:50:10,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:10,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2019-09-03 19:50:10,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:50:10,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:50:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:50:10,701 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2019-09-03 19:50:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:11,082 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-03 19:50:11,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:50:11,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-09-03 19:50:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:11,084 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:50:11,084 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:50:11,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:50:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:50:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-09-03 19:50:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:50:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-09-03 19:50:11,097 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2019-09-03 19:50:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:11,098 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-09-03 19:50:11,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:50:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-09-03 19:50:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:50:11,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:11,099 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:11,099 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:11,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:11,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1121217930, now seen corresponding path program 4 times [2019-09-03 19:50:11,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:50:11,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:11,234 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:50:11,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:11,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:11,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:11,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:50:11,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:11,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:50:11,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:11,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 18 [2019-09-03 19:50:11,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:50:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:50:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:50:11,401 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 18 states. [2019-09-03 19:50:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:11,641 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-09-03 19:50:11,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:50:11,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-09-03 19:50:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:11,643 INFO L225 Difference]: With dead ends: 47 [2019-09-03 19:50:11,643 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:50:11,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:50:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:50:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-09-03 19:50:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:50:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-03 19:50:11,650 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 31 [2019-09-03 19:50:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:11,650 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-03 19:50:11,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:50:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-03 19:50:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:50:11,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:11,652 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:11,652 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash -948049839, now seen corresponding path program 5 times [2019-09-03 19:50:11,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:11,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:11,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:50:11,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:11,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:11,932 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:11,949 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:50:11,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:11,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:50:11,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:12,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:12,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:12,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:50:12,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:12,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 25 [2019-09-03 19:50:12,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:50:12,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:50:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:50:12,255 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 25 states. [2019-09-03 19:50:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:12,729 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-09-03 19:50:12,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:50:12,729 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 38 [2019-09-03 19:50:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:12,730 INFO L225 Difference]: With dead ends: 80 [2019-09-03 19:50:12,731 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:50:12,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:50:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:50:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-09-03 19:50:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:50:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-03 19:50:12,739 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2019-09-03 19:50:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:12,739 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-03 19:50:12,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:50:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-03 19:50:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:50:12,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:12,740 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:12,741 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:12,741 INFO L82 PathProgramCache]: Analyzing trace with hash -129353064, now seen corresponding path program 6 times [2019-09-03 19:50:12,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:12,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:50:12,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:12,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:12,859 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:12,876 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:50:12,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:12,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:50:12,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:12,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:50:12,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:12,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2019-09-03 19:50:12,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:50:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:50:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:50:12,996 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 20 states. [2019-09-03 19:50:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:13,295 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-09-03 19:50:13,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:50:13,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2019-09-03 19:50:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:13,297 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:50:13,297 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:50:13,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:50:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:50:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-09-03 19:50:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:50:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-03 19:50:13,309 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 39 [2019-09-03 19:50:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:13,309 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-03 19:50:13,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:50:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-03 19:50:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:50:13,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:13,310 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:13,311 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash -379409, now seen corresponding path program 7 times [2019-09-03 19:50:13,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:13,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:13,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:13,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:50:13,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:13,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:13,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:13,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:50:13,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:13,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:13,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:14,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 19:50:14,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:14,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2019-09-03 19:50:14,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:50:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:50:14,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:50:14,077 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 29 states. [2019-09-03 19:50:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:14,720 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-09-03 19:50:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:50:14,721 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2019-09-03 19:50:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:14,723 INFO L225 Difference]: With dead ends: 95 [2019-09-03 19:50:14,723 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:50:14,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:50:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:50:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-09-03 19:50:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:50:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-03 19:50:14,732 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 46 [2019-09-03 19:50:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:14,732 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-03 19:50:14,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:50:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-03 19:50:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:50:14,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:14,734 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:14,734 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1353756362, now seen corresponding path program 8 times [2019-09-03 19:50:14,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:14,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:50:14,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:14,857 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:50:14,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:14,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:14,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:14,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:50:14,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:15,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:50:15,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:15,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-03 19:50:15,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:50:15,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:50:15,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:50:15,032 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 23 states. [2019-09-03 19:50:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:15,377 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-09-03 19:50:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:50:15,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2019-09-03 19:50:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:15,379 INFO L225 Difference]: With dead ends: 63 [2019-09-03 19:50:15,379 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 19:50:15,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:50:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 19:50:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-09-03 19:50:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:50:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-03 19:50:15,388 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 47 [2019-09-03 19:50:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:15,388 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-03 19:50:15,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:50:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-03 19:50:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:50:15,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:15,390 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:15,390 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1070984815, now seen corresponding path program 9 times [2019-09-03 19:50:15,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:15,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:15,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:15,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:15,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 40 proven. 31 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:50:15,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:15,837 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:50:15,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:15,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:50:15,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:15,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:50:15,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:16,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:16,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:16,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:16,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 19:50:16,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:16,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 34 [2019-09-03 19:50:16,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:50:16,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:50:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:50:16,468 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 34 states. [2019-09-03 19:50:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:17,333 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2019-09-03 19:50:17,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:50:17,334 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2019-09-03 19:50:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:17,335 INFO L225 Difference]: With dead ends: 110 [2019-09-03 19:50:17,335 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 19:50:17,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=1604, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:50:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 19:50:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2019-09-03 19:50:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:50:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-03 19:50:17,345 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 54 [2019-09-03 19:50:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:17,345 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-03 19:50:17,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:50:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-03 19:50:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:50:17,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:17,346 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:17,347 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:17,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1590757928, now seen corresponding path program 10 times [2019-09-03 19:50:17,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:17,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:17,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:17,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:17,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 31 proven. 47 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:50:17,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:17,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:17,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:17,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:17,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:17,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:50:17,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:17,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 19:50:17,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:17,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 27 [2019-09-03 19:50:17,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:50:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:50:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:50:17,735 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 27 states. [2019-09-03 19:50:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:18,310 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-09-03 19:50:18,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:50:18,311 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-09-03 19:50:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:18,312 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:50:18,312 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 19:50:18,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:50:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 19:50:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-09-03 19:50:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 19:50:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-09-03 19:50:18,321 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 55 [2019-09-03 19:50:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:18,321 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-09-03 19:50:18,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:50:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-09-03 19:50:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:50:18,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:18,323 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:18,323 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1029156177, now seen corresponding path program 11 times [2019-09-03 19:50:18,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:18,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:18,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:18,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 57 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:50:18,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:18,820 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:50:18,836 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:18,860 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:50:18,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:18,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:50:18,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:19,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:19,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:19,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:19,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 86 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 19:50:19,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:19,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 31 [2019-09-03 19:50:19,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:50:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:50:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:50:19,247 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 31 states. [2019-09-03 19:50:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:20,026 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-09-03 19:50:20,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:50:20,026 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-09-03 19:50:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:20,028 INFO L225 Difference]: With dead ends: 125 [2019-09-03 19:50:20,028 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 19:50:20,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:50:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 19:50:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2019-09-03 19:50:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 19:50:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-03 19:50:20,037 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2019-09-03 19:50:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:20,037 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-03 19:50:20,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:50:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-03 19:50:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-03 19:50:20,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:20,038 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:20,039 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1904476150, now seen corresponding path program 12 times [2019-09-03 19:50:20,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:20,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:20,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 40 proven. 65 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:50:20,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:20,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:20,245 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:20,273 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:50:20,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:20,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:50:20,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:20,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 12 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:50:20,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:20,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2019-09-03 19:50:20,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:50:20,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:50:20,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:50:20,528 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 29 states. [2019-09-03 19:50:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:21,043 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-09-03 19:50:21,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:50:21,043 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2019-09-03 19:50:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:21,045 INFO L225 Difference]: With dead ends: 79 [2019-09-03 19:50:21,045 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 19:50:21,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=1467, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:50:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 19:50:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2019-09-03 19:50:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:50:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-09-03 19:50:21,053 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 63 [2019-09-03 19:50:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:21,054 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-09-03 19:50:21,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:50:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-09-03 19:50:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 19:50:21,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:21,055 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:21,055 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash -791196975, now seen corresponding path program 13 times [2019-09-03 19:50:21,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:21,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:21,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:21,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 77 proven. 50 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:50:21,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:21,657 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:50:21,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:21,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:50:21,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:21,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:21,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:21,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:22,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 13 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 19:50:22,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:22,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 34 [2019-09-03 19:50:22,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:50:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:50:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:50:22,077 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 34 states. [2019-09-03 19:50:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:22,999 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2019-09-03 19:50:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:50:22,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-03 19:50:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:23,001 INFO L225 Difference]: With dead ends: 140 [2019-09-03 19:50:23,001 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 19:50:23,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=226, Invalid=1754, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:50:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 19:50:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2019-09-03 19:50:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 19:50:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-03 19:50:23,019 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 70 [2019-09-03 19:50:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:23,019 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-03 19:50:23,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:50:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-03 19:50:23,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-03 19:50:23,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:23,026 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:23,026 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:23,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:23,026 INFO L82 PathProgramCache]: Analyzing trace with hash -760168168, now seen corresponding path program 14 times [2019-09-03 19:50:23,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:23,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:23,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:23,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:23,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 50 proven. 86 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:50:23,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:23,496 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:50:23,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:23,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:23,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:23,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:50:23,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:23,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 14 proven. 122 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:50:23,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:23,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2019-09-03 19:50:23,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:50:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:50:23,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:50:23,742 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 32 states. [2019-09-03 19:50:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:24,306 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-09-03 19:50:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:50:24,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-09-03 19:50:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:24,308 INFO L225 Difference]: With dead ends: 87 [2019-09-03 19:50:24,309 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 19:50:24,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=421, Invalid=1835, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:50:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 19:50:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-09-03 19:50:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 19:50:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-09-03 19:50:24,332 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 71 [2019-09-03 19:50:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:24,333 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-09-03 19:50:24,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:50:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-09-03 19:50:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:50:24,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:24,334 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:24,334 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1796776081, now seen corresponding path program 15 times [2019-09-03 19:50:24,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:24,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:24,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 100 proven. 61 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:50:25,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:25,028 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:50:25,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:25,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:50:25,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:25,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:50:25,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:25,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:25,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:25,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:25,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 19:50:25,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:25,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 45 [2019-09-03 19:50:25,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:50:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:50:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1782, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:50:25,797 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 45 states. [2019-09-03 19:50:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:26,909 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2019-09-03 19:50:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:50:26,910 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 78 [2019-09-03 19:50:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:26,911 INFO L225 Difference]: With dead ends: 155 [2019-09-03 19:50:26,911 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 19:50:26,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=289, Invalid=2903, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:50:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 19:50:26,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2019-09-03 19:50:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 19:50:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-09-03 19:50:26,919 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2019-09-03 19:50:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:26,919 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-09-03 19:50:26,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:50:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-09-03 19:50:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-03 19:50:26,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:26,920 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:26,921 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1474666166, now seen corresponding path program 16 times [2019-09-03 19:50:26,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:26,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:26,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:26,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:26,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 61 proven. 110 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:50:27,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:27,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 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:50:27,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:50:27,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:27,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:27,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:50:27,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:27,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 15 proven. 177 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 19:50:27,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:27,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 36 [2019-09-03 19:50:27,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:50:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:50:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:50:27,488 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 36 states. [2019-09-03 19:50:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:28,254 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-09-03 19:50:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:50:28,254 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2019-09-03 19:50:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:28,256 INFO L225 Difference]: With dead ends: 95 [2019-09-03 19:50:28,256 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 19:50:28,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=2538, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:50:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 19:50:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-09-03 19:50:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 19:50:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-09-03 19:50:28,264 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2019-09-03 19:50:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:28,264 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-09-03 19:50:28,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:50:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-09-03 19:50:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:50:28,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:28,265 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:28,266 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:28,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash 233411601, now seen corresponding path program 17 times [2019-09-03 19:50:28,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:28,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:28,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:28,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:28,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 126 proven. 73 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:50:29,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:29,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:29,119 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:29,153 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:50:29,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:29,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:50:29,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:29,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:29,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:29,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:29,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 41 proven. 182 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-03 19:50:29,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:29,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 40 [2019-09-03 19:50:29,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:50:29,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:50:29,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:50:29,800 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 40 states. [2019-09-03 19:50:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:30,904 INFO L93 Difference]: Finished difference Result 170 states and 175 transitions. [2019-09-03 19:50:30,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:50:30,905 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 86 [2019-09-03 19:50:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:30,906 INFO L225 Difference]: With dead ends: 170 [2019-09-03 19:50:30,906 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 19:50:30,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=292, Invalid=2464, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:50:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 19:50:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2019-09-03 19:50:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 19:50:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-09-03 19:50:30,916 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 86 [2019-09-03 19:50:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:30,916 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-09-03 19:50:30,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:50:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-09-03 19:50:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 19:50:30,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:30,917 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:30,917 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash -382493608, now seen corresponding path program 18 times [2019-09-03 19:50:30,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:30,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 73 proven. 137 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:50:31,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:31,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:31,173 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:31,208 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:50:31,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:31,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:50:31,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:31,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 18 proven. 192 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:50:31,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:31,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2019-09-03 19:50:31,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:50:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:50:31,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:50:31,535 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 38 states. [2019-09-03 19:50:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:32,305 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-09-03 19:50:32,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:50:32,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 87 [2019-09-03 19:50:32,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:32,309 INFO L225 Difference]: With dead ends: 103 [2019-09-03 19:50:32,309 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 19:50:32,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=612, Invalid=2694, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:50:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 19:50:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-09-03 19:50:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 19:50:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-09-03 19:50:32,316 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 87 [2019-09-03 19:50:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:32,316 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-09-03 19:50:32,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:50:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-09-03 19:50:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 19:50:32,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:32,317 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:32,318 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash 567499823, now seen corresponding path program 19 times [2019-09-03 19:50:32,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:32,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:32,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:50:33,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:33,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 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:50:33,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:33,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:50:33,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:33,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:33,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:33,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:33,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 19 proven. 249 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-03 19:50:33,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:34,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 43 [2019-09-03 19:50:34,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:50:34,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:50:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:50:34,003 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 43 states. [2019-09-03 19:50:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:35,324 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-09-03 19:50:35,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:50:35,324 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 94 [2019-09-03 19:50:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:35,326 INFO L225 Difference]: With dead ends: 185 [2019-09-03 19:50:35,326 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 19:50:35,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=328, Invalid=2864, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:50:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 19:50:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2019-09-03 19:50:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-03 19:50:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-09-03 19:50:35,335 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 94 [2019-09-03 19:50:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:35,335 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-09-03 19:50:35,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:50:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-09-03 19:50:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-03 19:50:35,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:35,336 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:35,336 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1435512182, now seen corresponding path program 20 times [2019-09-03 19:50:35,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:35,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 86 proven. 167 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:50:35,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:35,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:35,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:35,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:35,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:35,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:50:35,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 20 proven. 233 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:50:36,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:36,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2019-09-03 19:50:36,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:50:36,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:50:36,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:50:36,123 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 41 states. [2019-09-03 19:50:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:37,027 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-09-03 19:50:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:50:37,027 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 95 [2019-09-03 19:50:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:37,028 INFO L225 Difference]: With dead ends: 111 [2019-09-03 19:50:37,028 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 19:50:37,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=721, Invalid=3185, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:50:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 19:50:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-09-03 19:50:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 19:50:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-09-03 19:50:37,039 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 95 [2019-09-03 19:50:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:37,040 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-09-03 19:50:37,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:50:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-09-03 19:50:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:50:37,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:37,041 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:37,042 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:37,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash 214232401, now seen corresponding path program 21 times [2019-09-03 19:50:37,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:37,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 187 proven. 100 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:50:38,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:38,019 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:50:38,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:38,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:50:38,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:38,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:50:38,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:39,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:39,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:39,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:39,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 51 proven. 266 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-03 19:50:39,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:39,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 57 [2019-09-03 19:50:39,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:50:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:50:39,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2898, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:50:39,362 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 57 states. [2019-09-03 19:50:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:41,381 INFO L93 Difference]: Finished difference Result 200 states and 205 transitions. [2019-09-03 19:50:41,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:50:41,382 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 102 [2019-09-03 19:50:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:41,384 INFO L225 Difference]: With dead ends: 200 [2019-09-03 19:50:41,384 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:50:41,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=409, Invalid=4703, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:50:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:50:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-09-03 19:50:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 19:50:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-09-03 19:50:41,394 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 102 [2019-09-03 19:50:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:41,394 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-09-03 19:50:41,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:50:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-09-03 19:50:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-03 19:50:41,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:41,395 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:41,396 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1038383208, now seen corresponding path program 22 times [2019-09-03 19:50:41,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:41,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:41,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 100 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:50:41,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:41,750 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:50:41,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:41,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:50:41,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:41,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:50:41,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:42,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 21 proven. 309 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:50:42,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:42,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 45 [2019-09-03 19:50:42,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:50:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:50:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1656, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:50:42,290 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 45 states. [2019-09-03 19:50:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:43,373 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-09-03 19:50:43,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:50:43,373 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 103 [2019-09-03 19:50:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:43,374 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:50:43,374 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 19:50:43,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=875, Invalid=4095, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:50:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 19:50:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-09-03 19:50:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:50:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-09-03 19:50:43,384 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 103 [2019-09-03 19:50:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:43,384 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-09-03 19:50:43,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:50:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-09-03 19:50:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:50:43,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:43,385 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:43,386 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:43,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1938311407, now seen corresponding path program 23 times [2019-09-03 19:50:43,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:43,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:43,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:43,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:43,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 222 proven. 115 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:50:44,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:44,873 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:50:44,883 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:50:44,924 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:50:44,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:44,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 19:50:44,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:45,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:45,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:45,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:45,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 56 proven. 314 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-03 19:50:45,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:45,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 49 [2019-09-03 19:50:45,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:50:45,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:50:45,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2058, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:50:45,659 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 49 states. [2019-09-03 19:50:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:47,200 INFO L93 Difference]: Finished difference Result 215 states and 220 transitions. [2019-09-03 19:50:47,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:50:47,201 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 110 [2019-09-03 19:50:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:47,202 INFO L225 Difference]: With dead ends: 215 [2019-09-03 19:50:47,202 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 19:50:47,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=406, Invalid=3754, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:50:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 19:50:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2019-09-03 19:50:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 19:50:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-03 19:50:47,213 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 110 [2019-09-03 19:50:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:47,213 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-03 19:50:47,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:50:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-03 19:50:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-03 19:50:47,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:47,214 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:47,214 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:47,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:47,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1130386378, now seen corresponding path program 24 times [2019-09-03 19:50:47,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:47,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 115 proven. 236 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:50:47,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:47,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:47,585 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:47,630 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:50:47,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:47,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:50:47,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:48,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 24 proven. 327 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 19:50:48,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:48,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 47 [2019-09-03 19:50:48,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:50:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:50:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:50:48,078 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 47 states. [2019-09-03 19:50:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:49,174 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-09-03 19:50:49,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:50:49,174 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 111 [2019-09-03 19:50:49,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:49,175 INFO L225 Difference]: With dead ends: 127 [2019-09-03 19:50:49,176 INFO L226 Difference]: Without dead ends: 125 [2019-09-03 19:50:49,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=966, Invalid=4290, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:50:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-03 19:50:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2019-09-03 19:50:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 19:50:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-09-03 19:50:49,187 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 111 [2019-09-03 19:50:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:49,189 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-09-03 19:50:49,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:50:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-09-03 19:50:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 19:50:49,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:49,191 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:49,191 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:49,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:49,191 INFO L82 PathProgramCache]: Analyzing trace with hash 600659601, now seen corresponding path program 25 times [2019-09-03 19:50:49,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:49,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:49,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 260 proven. 131 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:50,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:50,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:50,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:50,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 19:50:50,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:51,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:51,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:51,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 25 proven. 402 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:50:51,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:51,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 52 [2019-09-03 19:50:51,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:50:51,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:50:51,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2323, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:50:51,317 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 52 states. [2019-09-03 19:50:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:53,173 INFO L93 Difference]: Finished difference Result 230 states and 235 transitions. [2019-09-03 19:50:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:50:53,174 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 118 [2019-09-03 19:50:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:53,175 INFO L225 Difference]: With dead ends: 230 [2019-09-03 19:50:53,176 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 19:50:53,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=448, Invalid=4244, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:50:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 19:50:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2019-09-03 19:50:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 19:50:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-09-03 19:50:53,186 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 118 [2019-09-03 19:50:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:53,186 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-09-03 19:50:53,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:50:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-09-03 19:50:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-03 19:50:53,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:53,188 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:53,188 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash -70483240, now seen corresponding path program 26 times [2019-09-03 19:50:53,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:53,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:53,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 131 proven. 275 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:53,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:53,602 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:50:53,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:53,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:53,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:53,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:50:53,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 26 proven. 380 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:54,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:54,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 50 [2019-09-03 19:50:54,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:50:54,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:50:54,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=2035, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:50:54,739 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 50 states. [2019-09-03 19:50:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:55,942 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2019-09-03 19:50:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:50:55,943 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 119 [2019-09-03 19:50:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:55,944 INFO L225 Difference]: With dead ends: 135 [2019-09-03 19:50:55,944 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 19:50:55,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1102, Invalid=4904, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:50:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 19:50:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-09-03 19:50:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 19:50:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-09-03 19:50:55,955 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 119 [2019-09-03 19:50:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:55,955 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-09-03 19:50:55,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:50:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-09-03 19:50:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 19:50:55,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:55,957 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:55,957 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1289607761, now seen corresponding path program 27 times [2019-09-03 19:50:55,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:55,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:55,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 301 proven. 148 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:50:57,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:57,281 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:50:57,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:50:57,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:50:57,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:57,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:50:57,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:58,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:58,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:58,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:58,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 66 proven. 422 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-03 19:50:58,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:58,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 69 [2019-09-03 19:50:58,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:50:58,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:50:58,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=4284, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:50:58,947 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 69 states. [2019-09-03 19:51:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:01,568 INFO L93 Difference]: Finished difference Result 245 states and 250 transitions. [2019-09-03 19:51:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:51:01,569 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 126 [2019-09-03 19:51:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:01,570 INFO L225 Difference]: With dead ends: 245 [2019-09-03 19:51:01,570 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 19:51:01,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=547, Invalid=6935, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:51:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 19:51:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2019-09-03 19:51:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 19:51:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-09-03 19:51:01,582 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 126 [2019-09-03 19:51:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:01,582 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-09-03 19:51:01,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:51:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-09-03 19:51:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 19:51:01,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:01,583 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:01,583 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash -30401802, now seen corresponding path program 28 times [2019-09-03 19:51:01,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:01,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:01,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 148 proven. 317 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 19:51:02,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:02,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:02,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:02,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:02,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:02,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:51:02,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:02,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 27 proven. 477 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-03 19:51:02,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:02,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 54 [2019-09-03 19:51:02,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:51:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:51:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=2394, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:51:02,675 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 54 states. [2019-09-03 19:51:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:04,233 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-09-03 19:51:04,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:51:04,234 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 127 [2019-09-03 19:51:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:04,235 INFO L225 Difference]: With dead ends: 143 [2019-09-03 19:51:04,235 INFO L226 Difference]: Without dead ends: 141 [2019-09-03 19:51:04,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1289, Invalid=6021, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:51:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-03 19:51:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2019-09-03 19:51:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 19:51:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-09-03 19:51:04,246 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 127 [2019-09-03 19:51:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:04,247 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-09-03 19:51:04,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:51:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-09-03 19:51:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 19:51:04,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:04,248 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:04,248 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1436102703, now seen corresponding path program 29 times [2019-09-03 19:51:04,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 345 proven. 166 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:51:05,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:05,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05,716 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:05,775 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:51:05,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:05,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 19:51:05,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:06,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:06,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:06,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:06,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 71 proven. 482 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-03 19:51:06,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:06,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 58 [2019-09-03 19:51:06,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:51:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:51:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2901, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:51:06,929 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 58 states. [2019-09-03 19:51:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:08,982 INFO L93 Difference]: Finished difference Result 260 states and 265 transitions. [2019-09-03 19:51:08,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:51:08,982 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 134 [2019-09-03 19:51:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:08,984 INFO L225 Difference]: With dead ends: 260 [2019-09-03 19:51:08,984 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 19:51:08,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=538, Invalid=5314, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:51:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 19:51:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2019-09-03 19:51:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 19:51:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-09-03 19:51:08,996 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 134 [2019-09-03 19:51:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:08,997 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-09-03 19:51:08,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:51:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-09-03 19:51:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-03 19:51:08,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:08,998 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:08,998 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash 900369944, now seen corresponding path program 30 times [2019-09-03 19:51:08,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:08,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:08,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 166 proven. 362 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:51:09,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:09,452 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:09,462 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:09,517 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:51:09,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:09,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:51:09,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:10,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 30 proven. 498 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 19:51:10,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:10,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 56 [2019-09-03 19:51:10,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:51:10,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:51:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:51:10,147 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 56 states. [2019-09-03 19:51:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:11,665 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2019-09-03 19:51:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:51:11,666 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 135 [2019-09-03 19:51:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:11,667 INFO L225 Difference]: With dead ends: 151 [2019-09-03 19:51:11,667 INFO L226 Difference]: Without dead ends: 149 [2019-09-03 19:51:11,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1401, Invalid=6255, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:51:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-03 19:51:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-09-03 19:51:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 19:51:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-03 19:51:11,679 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 135 [2019-09-03 19:51:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:11,680 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-03 19:51:11,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:51:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-03 19:51:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 19:51:11,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:11,681 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:11,681 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash -390270353, now seen corresponding path program 31 times [2019-09-03 19:51:11,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:11,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:11,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:11,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 392 proven. 185 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:51:13,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:13,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:13,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:13,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 19:51:13,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:14,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:14,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 31 proven. 591 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-03 19:51:14,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:14,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 61 [2019-09-03 19:51:14,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:51:14,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:51:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=3214, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:51:14,627 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 61 states. [2019-09-03 19:51:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:16,761 INFO L93 Difference]: Finished difference Result 275 states and 280 transitions. [2019-09-03 19:51:16,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:51:16,762 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 142 [2019-09-03 19:51:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:16,764 INFO L225 Difference]: With dead ends: 275 [2019-09-03 19:51:16,764 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 19:51:16,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=586, Invalid=5894, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:51:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 19:51:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-09-03 19:51:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 19:51:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-09-03 19:51:16,776 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 142 [2019-09-03 19:51:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:16,776 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-09-03 19:51:16,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:51:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-09-03 19:51:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-03 19:51:16,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:16,777 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:16,777 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1784510902, now seen corresponding path program 32 times [2019-09-03 19:51:16,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:16,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 185 proven. 410 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:51:17,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:17,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:17,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:17,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:17,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:17,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:51:17,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:18,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 32 proven. 563 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:51:18,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:18,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 59 [2019-09-03 19:51:18,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:51:18,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:51:18,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=2845, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:51:18,304 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 59 states. [2019-09-03 19:51:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:20,014 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2019-09-03 19:51:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:51:20,015 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 143 [2019-09-03 19:51:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:20,016 INFO L225 Difference]: With dead ends: 159 [2019-09-03 19:51:20,017 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 19:51:20,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1564, Invalid=6992, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:51:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 19:51:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-09-03 19:51:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 19:51:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-09-03 19:51:20,031 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 143 [2019-09-03 19:51:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:20,032 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-09-03 19:51:20,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:51:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-09-03 19:51:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 19:51:20,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:20,033 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:20,033 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash 955603217, now seen corresponding path program 33 times [2019-09-03 19:51:20,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:20,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:20,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 442 proven. 205 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 19:51:21,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:21,848 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:21,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:21,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 19:51:21,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:21,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:51:21,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:23,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:23,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:23,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 81 proven. 614 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-03 19:51:24,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:24,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 81 [2019-09-03 19:51:24,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 19:51:24,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 19:51:24,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=5940, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:51:24,116 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 81 states. [2019-09-03 19:51:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:27,655 INFO L93 Difference]: Finished difference Result 290 states and 295 transitions. [2019-09-03 19:51:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:51:27,655 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 150 [2019-09-03 19:51:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:27,657 INFO L225 Difference]: With dead ends: 290 [2019-09-03 19:51:27,657 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 19:51:27,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2571 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=703, Invalid=9599, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:51:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 19:51:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2019-09-03 19:51:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 19:51:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-03 19:51:27,671 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 150 [2019-09-03 19:51:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:27,673 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-03 19:51:27,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 19:51:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-03 19:51:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-03 19:51:27,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:27,674 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:27,674 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1343859032, now seen corresponding path program 34 times [2019-09-03 19:51:27,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 205 proven. 461 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 19:51:28,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:28,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:28,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:51:28,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:51:28,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:28,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:51:28,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:29,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 33 proven. 681 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-03 19:51:29,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:29,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 43] total 63 [2019-09-03 19:51:29,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:51:29,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:51:29,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=3267, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:51:29,144 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 63 states. [2019-09-03 19:51:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:31,235 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2019-09-03 19:51:31,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:51:31,236 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 151 [2019-09-03 19:51:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:31,237 INFO L225 Difference]: With dead ends: 167 [2019-09-03 19:51:31,238 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 19:51:31,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1784, Invalid=8316, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:51:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 19:51:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-09-03 19:51:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 19:51:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-09-03 19:51:31,250 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 151 [2019-09-03 19:51:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:31,251 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-09-03 19:51:31,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:51:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-09-03 19:51:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 19:51:31,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:31,252 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:31,252 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1149980881, now seen corresponding path program 35 times [2019-09-03 19:51:31,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:31,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:31,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:31,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:31,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 495 proven. 226 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 19:51:33,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:33,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:33,144 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:51:33,207 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-03 19:51:33,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:33,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 19:51:33,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:34,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:34,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:34,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:34,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 86 proven. 686 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-03 19:51:34,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:34,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 67 [2019-09-03 19:51:34,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:51:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:51:34,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=3888, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:51:34,491 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 67 states. [2019-09-03 19:51:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:36,981 INFO L93 Difference]: Finished difference Result 305 states and 310 transitions. [2019-09-03 19:51:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:51:36,981 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 158 [2019-09-03 19:51:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:36,983 INFO L225 Difference]: With dead ends: 305 [2019-09-03 19:51:36,983 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 19:51:36,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=688, Invalid=7144, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 19:51:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 19:51:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2019-09-03 19:51:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 19:51:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-03 19:51:36,997 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 158 [2019-09-03 19:51:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:36,997 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-03 19:51:36,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:51:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-03 19:51:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-03 19:51:36,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:36,998 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:36,998 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:36,999 INFO L82 PathProgramCache]: Analyzing trace with hash -263993226, now seen corresponding path program 36 times [2019-09-03 19:51:36,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:36,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:37,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 226 proven. 515 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 19:51:37,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:37,605 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:37,615 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:51:37,722 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:51:37,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:37,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:51:37,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:38,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 44 proven. 748 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-03 19:51:38,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:38,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 45] total 66 [2019-09-03 19:51:38,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:51:38,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:51:38,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=3588, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:51:38,593 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 66 states. [2019-09-03 19:51:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:40,726 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2019-09-03 19:51:40,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:51:40,727 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 159 [2019-09-03 19:51:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:40,729 INFO L225 Difference]: With dead ends: 175 [2019-09-03 19:51:40,729 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 19:51:40,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2776 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1967, Invalid=9163, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:51:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 19:51:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2019-09-03 19:51:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 19:51:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-09-03 19:51:40,743 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 159 [2019-09-03 19:51:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:40,743 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-09-03 19:51:40,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:51:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-09-03 19:51:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 19:51:40,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:40,745 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:40,745 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash -388173231, now seen corresponding path program 37 times [2019-09-03 19:51:40,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:40,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:40,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 551 proven. 248 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:51:42,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:42,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:42,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 19:51:42,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:44,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:44,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 37 proven. 816 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-03 19:51:44,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:44,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48] total 70 [2019-09-03 19:51:44,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:51:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:51:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=4249, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:51:44,313 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 70 states. [2019-09-03 19:51:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:47,564 INFO L93 Difference]: Finished difference Result 320 states and 325 transitions. [2019-09-03 19:51:47,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:51:47,564 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-09-03 19:51:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:47,566 INFO L225 Difference]: With dead ends: 320 [2019-09-03 19:51:47,566 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 19:51:47,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=742, Invalid=7814, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:51:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 19:51:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2019-09-03 19:51:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-03 19:51:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-03 19:51:47,581 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 166 [2019-09-03 19:51:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:47,581 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-03 19:51:47,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:51:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-03 19:51:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 19:51:47,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:47,582 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:47,583 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1401039720, now seen corresponding path program 38 times [2019-09-03 19:51:47,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:47,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 248 proven. 572 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:51:48,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:48,323 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:48,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:48,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:48,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:48,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 19:51:48,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:49,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 38 proven. 782 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 19:51:49,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:49,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 68 [2019-09-03 19:51:49,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:51:49,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:51:49,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=3790, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:51:49,323 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 68 states. [2019-09-03 19:51:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:51,475 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2019-09-03 19:51:51,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:51:51,476 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 167 [2019-09-03 19:51:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:51,477 INFO L225 Difference]: With dead ends: 183 [2019-09-03 19:51:51,477 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 19:51:51,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2107, Invalid=9449, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:51:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 19:51:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2019-09-03 19:51:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 19:51:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-09-03 19:51:51,489 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 167 [2019-09-03 19:51:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:51,490 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-09-03 19:51:51,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:51:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-09-03 19:51:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 19:51:51,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:51,491 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:51,491 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 828726255, now seen corresponding path program 39 times [2019-09-03 19:51:51,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:51,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:51,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:51,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:51,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 610 proven. 271 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 19:51:54,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:54,089 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:54,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:51:54,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 19:51:54,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:54,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:51:54,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:56,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:56,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:56,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:56,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 39 proven. 899 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-09-03 19:51:56,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:56,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 93 [2019-09-03 19:51:56,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 19:51:56,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 19:51:56,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=7866, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:51:56,855 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 93 states. [2019-09-03 19:52:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:01,492 INFO L93 Difference]: Finished difference Result 335 states and 340 transitions. [2019-09-03 19:52:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:52:01,492 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 174 [2019-09-03 19:52:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:01,494 INFO L225 Difference]: With dead ends: 335 [2019-09-03 19:52:01,494 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 19:52:01,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3408 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=877, Invalid=12695, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:52:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 19:52:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2019-09-03 19:52:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 19:52:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-03 19:52:01,506 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 174 [2019-09-03 19:52:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:01,506 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-03 19:52:01,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 19:52:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-03 19:52:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-03 19:52:01,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:01,507 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:01,507 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash -570489034, now seen corresponding path program 40 times [2019-09-03 19:52:01,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:01,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:01,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:01,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:01,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 271 proven. 632 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 19:52:02,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:02,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:02,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:02,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:02,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:02,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 19:52:02,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:03,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 39 proven. 921 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-09-03 19:52:03,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:03,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 49] total 72 [2019-09-03 19:52:03,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 19:52:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 19:52:03,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=4275, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:52:03,301 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 72 states. [2019-09-03 19:52:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:05,904 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2019-09-03 19:52:05,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:52:05,904 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 175 [2019-09-03 19:52:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:05,906 INFO L225 Difference]: With dead ends: 191 [2019-09-03 19:52:05,906 INFO L226 Difference]: Without dead ends: 189 [2019-09-03 19:52:05,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3344 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2360, Invalid=10980, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 19:52:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-03 19:52:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-09-03 19:52:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 19:52:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-09-03 19:52:05,921 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 175 [2019-09-03 19:52:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:05,922 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-09-03 19:52:05,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 19:52:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-09-03 19:52:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 19:52:05,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:05,923 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:05,924 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:05,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1803445359, now seen corresponding path program 41 times [2019-09-03 19:52:05,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:05,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:05,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 672 proven. 295 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:52:08,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:08,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08,284 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:08,370 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-03 19:52:08,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:08,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 19:52:08,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:09,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:09,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:09,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:09,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 101 proven. 926 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-03 19:52:10,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:10,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52] total 76 [2019-09-03 19:52:10,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 19:52:10,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 19:52:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=681, Invalid=5019, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:52:10,093 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 76 states. [2019-09-03 19:52:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:13,729 INFO L93 Difference]: Finished difference Result 350 states and 355 transitions. [2019-09-03 19:52:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:52:13,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 182 [2019-09-03 19:52:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:13,732 INFO L225 Difference]: With dead ends: 350 [2019-09-03 19:52:13,732 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 19:52:13,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1926 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=856, Invalid=9244, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:52:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 19:52:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2019-09-03 19:52:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 19:52:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-09-03 19:52:13,747 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 182 [2019-09-03 19:52:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:13,747 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-09-03 19:52:13,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 19:52:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-09-03 19:52:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-03 19:52:13,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:13,749 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:13,749 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1832587224, now seen corresponding path program 42 times [2019-09-03 19:52:13,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:13,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:13,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:13,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:13,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 295 proven. 695 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:52:14,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:14,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14,914 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:15,025 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-03 19:52:15,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:15,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 19:52:15,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 42 proven. 948 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 19:52:16,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:16,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 74 [2019-09-03 19:52:16,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 19:52:16,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 19:52:16,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=4495, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:52:16,174 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 74 states. [2019-09-03 19:52:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:18,726 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2019-09-03 19:52:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:52:18,726 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 183 [2019-09-03 19:52:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:18,728 INFO L225 Difference]: With dead ends: 199 [2019-09-03 19:52:18,728 INFO L226 Difference]: Without dead ends: 197 [2019-09-03 19:52:18,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3335 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2514, Invalid=11292, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:52:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-03 19:52:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2019-09-03 19:52:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 19:52:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-09-03 19:52:18,744 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 183 [2019-09-03 19:52:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:18,745 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-09-03 19:52:18,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 19:52:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-09-03 19:52:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 19:52:18,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:18,746 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:18,746 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1873475759, now seen corresponding path program 43 times [2019-09-03 19:52:18,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:18,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:18,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:18,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 737 proven. 320 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 19:52:21,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:21,235 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:21,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:21,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 19:52:21,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:22,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:22,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:22,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:22,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 43 proven. 1077 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-03 19:52:23,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:23,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 54] total 79 [2019-09-03 19:52:23,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 19:52:23,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 19:52:23,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=5428, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:52:23,127 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 79 states. [2019-09-03 19:52:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:26,672 INFO L93 Difference]: Finished difference Result 365 states and 370 transitions. [2019-09-03 19:52:26,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:52:26,672 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 190 [2019-09-03 19:52:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:26,674 INFO L225 Difference]: With dead ends: 365 [2019-09-03 19:52:26,674 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 19:52:26,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2082 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=916, Invalid=10004, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 19:52:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 19:52:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-09-03 19:52:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 19:52:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-03 19:52:26,692 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 190 [2019-09-03 19:52:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:26,692 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-03 19:52:26,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 19:52:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-03 19:52:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-03 19:52:26,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:26,694 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:26,694 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:26,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1599392266, now seen corresponding path program 44 times [2019-09-03 19:52:26,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:26,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:26,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:26,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:52:26,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 320 proven. 761 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 19:52:27,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:27,585 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:27,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:52:27,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:52:27,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:27,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:52:27,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:28,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 44 proven. 1037 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 19:52:28,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:28,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 77 [2019-09-03 19:52:28,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 19:52:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 19:52:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=982, Invalid=4870, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:52:28,809 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 77 states. [2019-09-03 19:52:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:31,399 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2019-09-03 19:52:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:52:31,400 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 191 [2019-09-03 19:52:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:31,401 INFO L225 Difference]: With dead ends: 207 [2019-09-03 19:52:31,402 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 19:52:31,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3636 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2731, Invalid=12275, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 19:52:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 19:52:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2019-09-03 19:52:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 19:52:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-09-03 19:52:31,420 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 191 [2019-09-03 19:52:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:31,420 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-09-03 19:52:31,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 19:52:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-09-03 19:52:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 19:52:31,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:31,421 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:31,422 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash 390550737, now seen corresponding path program 45 times [2019-09-03 19:52:31,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:31,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:31,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:31,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 805 proven. 346 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 19:52:34,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:34,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:34,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:52:34,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 19:52:34,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:34,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 19:52:34,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:37,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:37,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 111 proven. 1106 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-03 19:52:37,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:37,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56] total 105 [2019-09-03 19:52:37,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 19:52:37,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 19:52:37,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=858, Invalid=10062, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 19:52:37,721 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 105 states. [2019-09-03 19:52:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:41,586 INFO L93 Difference]: Finished difference Result 380 states and 385 transitions. [2019-09-03 19:52:41,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:52:41,587 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 198 [2019-09-03 19:52:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:41,589 INFO L225 Difference]: With dead ends: 380 [2019-09-03 19:52:41,589 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 19:52:41,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4362 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1069, Invalid=16223, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 19:52:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 19:52:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2019-09-03 19:52:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 19:52:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-03 19:52:41,605 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 198 [2019-09-03 19:52:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:41,605 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-03 19:52:41,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 19:52:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-03 19:52:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-03 19:52:41,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:41,606 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:41,606 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1246405864, now seen corresponding path program 46 times [2019-09-03 19:52:41,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:41,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 346 proven. 830 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 19:52:42,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:42,530 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:42,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:42,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:42,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:42,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:52:42,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:43,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 45 proven. 1197 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-03 19:52:43,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:43,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 55] total 81 [2019-09-03 19:52:43,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 19:52:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 19:52:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1062, Invalid=5418, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:52:43,881 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 81 states. [2019-09-03 19:52:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:46,867 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2019-09-03 19:52:46,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:52:46,867 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 199 [2019-09-03 19:52:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:46,869 INFO L225 Difference]: With dead ends: 215 [2019-09-03 19:52:46,869 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 19:52:46,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4289 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3017, Invalid=14013, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 19:52:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 19:52:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2019-09-03 19:52:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 19:52:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-09-03 19:52:46,886 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 199 [2019-09-03 19:52:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:46,886 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-09-03 19:52:46,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 19:52:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-09-03 19:52:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-03 19:52:46,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:46,888 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:46,889 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:46,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:46,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2053211503, now seen corresponding path program 47 times [2019-09-03 19:52:46,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:46,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:46,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:46,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:46,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 876 proven. 373 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:52:49,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:49,774 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:49,785 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:52:49,871 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-03 19:52:49,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:49,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-03 19:52:49,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:51,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:51,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:51,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:51,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 116 proven. 1202 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-09-03 19:52:51,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 58] total 85 [2019-09-03 19:52:51,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 19:52:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 19:52:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=6294, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:52:51,942 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 85 states. [2019-09-03 19:52:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:55,976 INFO L93 Difference]: Finished difference Result 395 states and 400 transitions. [2019-09-03 19:52:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:52:55,977 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 206 [2019-09-03 19:52:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:55,979 INFO L225 Difference]: With dead ends: 395 [2019-09-03 19:52:55,979 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 19:52:55,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1042, Invalid=11614, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:52:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 19:52:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2019-09-03 19:52:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-03 19:52:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-03 19:52:55,997 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 206 [2019-09-03 19:52:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:55,997 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-03 19:52:55,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 19:52:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-03 19:52:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 19:52:55,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:55,999 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:56,000 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2073799498, now seen corresponding path program 48 times [2019-09-03 19:52:56,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:56,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:56,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 373 proven. 902 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:52:56,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:56,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57,007 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:52:57,096 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:52:57,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:57,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:52:57,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:58,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:52:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 48 proven. 1227 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 19:52:58,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:58,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 83 [2019-09-03 19:52:58,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 19:52:58,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 19:52:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1141, Invalid=5665, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:52:58,476 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 83 states. [2019-09-03 19:53:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:01,670 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2019-09-03 19:53:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:53:01,671 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 207 [2019-09-03 19:53:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:01,673 INFO L225 Difference]: With dead ends: 223 [2019-09-03 19:53:01,673 INFO L226 Difference]: Without dead ends: 221 [2019-09-03 19:53:01,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3192, Invalid=14364, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 19:53:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-03 19:53:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2019-09-03 19:53:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 19:53:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2019-09-03 19:53:01,692 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 207 [2019-09-03 19:53:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:01,693 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2019-09-03 19:53:01,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 19:53:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2019-09-03 19:53:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-03 19:53:01,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:01,695 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:01,695 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1919803887, now seen corresponding path program 49 times [2019-09-03 19:53:01,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:01,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:01,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 950 proven. 401 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:53:04,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:04,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 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:53:04,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:04,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-03 19:53:04,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:06,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:06,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 49 proven. 1374 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-09-03 19:53:06,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:06,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 60] total 88 [2019-09-03 19:53:06,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 19:53:06,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 19:53:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=6751, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:53:06,999 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 88 states. [2019-09-03 19:53:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:11,698 INFO L93 Difference]: Finished difference Result 410 states and 415 transitions. [2019-09-03 19:53:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:53:11,698 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 214 [2019-09-03 19:53:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:11,701 INFO L225 Difference]: With dead ends: 410 [2019-09-03 19:53:11,701 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 19:53:11,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2586 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1108, Invalid=12464, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:53:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 19:53:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2019-09-03 19:53:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-03 19:53:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 219 transitions. [2019-09-03 19:53:11,719 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 219 transitions. Word has length 214 [2019-09-03 19:53:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:11,719 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 219 transitions. [2019-09-03 19:53:11,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 19:53:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2019-09-03 19:53:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-03 19:53:11,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:11,721 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:11,721 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash -363809192, now seen corresponding path program 50 times [2019-09-03 19:53:11,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:11,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:11,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:11,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:11,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 401 proven. 977 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:53:12,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:12,781 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:53:12,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:12,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:12,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:12,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 19:53:12,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 50 proven. 1328 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 19:53:14,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:14,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 86 [2019-09-03 19:53:14,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 19:53:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 19:53:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=6085, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:53:14,284 INFO L87 Difference]: Start difference. First operand 218 states and 219 transitions. Second operand 86 states. [2019-09-03 19:53:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:17,407 INFO L93 Difference]: Finished difference Result 231 states and 233 transitions. [2019-09-03 19:53:17,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:53:17,408 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 215 [2019-09-03 19:53:17,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:17,410 INFO L225 Difference]: With dead ends: 231 [2019-09-03 19:53:17,410 INFO L226 Difference]: Without dead ends: 229 [2019-09-03 19:53:17,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4617 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3436, Invalid=15470, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 19:53:17,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-03 19:53:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2019-09-03 19:53:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-03 19:53:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2019-09-03 19:53:17,429 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 215 [2019-09-03 19:53:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:17,430 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2019-09-03 19:53:17,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 19:53:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2019-09-03 19:53:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-03 19:53:17,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:17,431 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:17,432 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash -190512593, now seen corresponding path program 51 times [2019-09-03 19:53:17,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:17,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:17,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:17,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:17,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 1027 proven. 430 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 19:53:20,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:20,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:20,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:20,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 19:53:20,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:20,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:53:20,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:24,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:24,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:24,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:24,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 126 proven. 1406 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 19:53:25,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:25,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 62] total 117 [2019-09-03 19:53:25,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 19:53:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 19:53:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1044, Invalid=12528, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:53:25,176 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 117 states. [2019-09-03 19:53:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:33,210 INFO L93 Difference]: Finished difference Result 425 states and 430 transitions. [2019-09-03 19:53:33,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:53:33,210 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 222 [2019-09-03 19:53:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:33,212 INFO L225 Difference]: With dead ends: 425 [2019-09-03 19:53:33,212 INFO L226 Difference]: Without dead ends: 234 [2019-09-03 19:53:33,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5433 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1279, Invalid=20183, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 19:53:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-03 19:53:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2019-09-03 19:53:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 19:53:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2019-09-03 19:53:33,232 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 222 [2019-09-03 19:53:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:33,232 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2019-09-03 19:53:33,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 19:53:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2019-09-03 19:53:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-03 19:53:33,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:33,234 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:33,234 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1950770038, now seen corresponding path program 52 times [2019-09-03 19:53:33,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:33,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:33,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 430 proven. 1055 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 19:53:34,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:34,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:34,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:34,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:34,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:34,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 19:53:34,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 51 proven. 1509 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-03 19:53:36,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:36,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 61] total 90 [2019-09-03 19:53:36,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 19:53:36,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 19:53:36,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1314, Invalid=6696, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:53:36,150 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 90 states. [2019-09-03 19:53:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:39,761 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2019-09-03 19:53:39,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:53:39,762 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 223 [2019-09-03 19:53:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:39,764 INFO L225 Difference]: With dead ends: 239 [2019-09-03 19:53:39,764 INFO L226 Difference]: Without dead ends: 237 [2019-09-03 19:53:39,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5351 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3755, Invalid=17415, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 19:53:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-03 19:53:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2019-09-03 19:53:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 19:53:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2019-09-03 19:53:39,779 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 223 [2019-09-03 19:53:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:39,779 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2019-09-03 19:53:39,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 19:53:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2019-09-03 19:53:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-03 19:53:39,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:39,781 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:39,781 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1798965423, now seen corresponding path program 53 times [2019-09-03 19:53:39,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:39,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:39,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 1107 proven. 460 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 19:53:43,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:43,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:43,113 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:43,225 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-03 19:53:43,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:43,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-03 19:53:43,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:45,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:45,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:45,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:45,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 131 proven. 1514 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-09-03 19:53:45,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:45,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 64] total 94 [2019-09-03 19:53:45,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 19:53:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 19:53:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=7713, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:53:45,811 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 94 states. [2019-09-03 19:53:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:50,574 INFO L93 Difference]: Finished difference Result 440 states and 445 transitions. [2019-09-03 19:53:50,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:53:50,574 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 230 [2019-09-03 19:53:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:50,576 INFO L225 Difference]: With dead ends: 440 [2019-09-03 19:53:50,576 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 19:53:50,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1246, Invalid=14254, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 19:53:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 19:53:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2019-09-03 19:53:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-03 19:53:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2019-09-03 19:53:50,598 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 230 [2019-09-03 19:53:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:50,598 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2019-09-03 19:53:50,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 19:53:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2019-09-03 19:53:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-03 19:53:50,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:50,600 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:50,600 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash -261021288, now seen corresponding path program 54 times [2019-09-03 19:53:50,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:50,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:50,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 460 proven. 1136 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 19:53:51,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:51,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:51,880 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-03 19:53:51,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:51,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 19:53:51,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:53,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:53:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 54 proven. 1542 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 19:53:53,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:53,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 92 [2019-09-03 19:53:53,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 19:53:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 19:53:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=6970, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:53:53,454 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 92 states. [2019-09-03 19:53:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:57,171 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2019-09-03 19:53:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:53:57,171 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 231 [2019-09-03 19:53:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:57,173 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:53:57,173 INFO L226 Difference]: Without dead ends: 245 [2019-09-03 19:53:57,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5336 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3951, Invalid=17805, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:53:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-03 19:53:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2019-09-03 19:53:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-03 19:53:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2019-09-03 19:53:57,195 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 231 [2019-09-03 19:53:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:57,195 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2019-09-03 19:53:57,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 19:53:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2019-09-03 19:53:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-03 19:53:57,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:57,197 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:57,197 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:57,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:57,198 INFO L82 PathProgramCache]: Analyzing trace with hash -527339793, now seen corresponding path program 55 times [2019-09-03 19:53:57,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:57,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:57,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 1190 proven. 491 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:54:00,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:00,779 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:54:00,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:00,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-03 19:54:00,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:03,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:03,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:03,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:03,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 55 proven. 1707 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-09-03 19:54:03,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:03,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66] total 97 [2019-09-03 19:54:03,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 19:54:03,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 19:54:03,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1094, Invalid=8218, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:54:03,538 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 97 states. [2019-09-03 19:54:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:08,980 INFO L93 Difference]: Finished difference Result 455 states and 460 transitions. [2019-09-03 19:54:08,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:54:08,980 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 238 [2019-09-03 19:54:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:08,982 INFO L225 Difference]: With dead ends: 455 [2019-09-03 19:54:08,982 INFO L226 Difference]: Without dead ends: 250 [2019-09-03 19:54:08,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1318, Invalid=15194, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 19:54:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-03 19:54:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2019-09-03 19:54:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-03 19:54:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2019-09-03 19:54:09,004 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 238 [2019-09-03 19:54:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:09,004 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 243 transitions. [2019-09-03 19:54:09,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 19:54:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 243 transitions. [2019-09-03 19:54:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-03 19:54:09,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:09,006 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:09,007 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:09,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:09,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1167236554, now seen corresponding path program 56 times [2019-09-03 19:54:09,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:09,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:09,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:09,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:09,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 491 proven. 1220 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:54:10,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:10,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:10,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:10,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:10,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:10,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:54:10,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:12,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 56 proven. 1655 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 19:54:12,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:12,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 95 [2019-09-03 19:54:12,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 19:54:12,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 19:54:12,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=7435, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:54:12,158 INFO L87 Difference]: Start difference. First operand 242 states and 243 transitions. Second operand 95 states. [2019-09-03 19:54:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:15,982 INFO L93 Difference]: Finished difference Result 255 states and 257 transitions. [2019-09-03 19:54:15,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:54:15,983 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 239 [2019-09-03 19:54:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:15,984 INFO L225 Difference]: With dead ends: 255 [2019-09-03 19:54:15,984 INFO L226 Difference]: Without dead ends: 253 [2019-09-03 19:54:15,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5715 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4222, Invalid=19034, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 19:54:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-03 19:54:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-09-03 19:54:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-03 19:54:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2019-09-03 19:54:16,009 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 239 [2019-09-03 19:54:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:16,009 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2019-09-03 19:54:16,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 19:54:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2019-09-03 19:54:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-03 19:54:16,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:16,011 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:16,012 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1958289263, now seen corresponding path program 57 times [2019-09-03 19:54:16,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:16,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 1276 proven. 523 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 19:54:19,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:19,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:54:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:19,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 19:54:19,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:19,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-03 19:54:19,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:24,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:24,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:24,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:24,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 141 proven. 1742 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-09-03 19:54:25,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:25,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 68] total 129 [2019-09-03 19:54:25,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 19:54:25,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 19:54:25,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1248, Invalid=15264, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 19:54:25,169 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 129 states. [2019-09-03 19:54:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:33,391 INFO L93 Difference]: Finished difference Result 470 states and 475 transitions. [2019-09-03 19:54:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:54:33,392 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 246 [2019-09-03 19:54:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:33,394 INFO L225 Difference]: With dead ends: 470 [2019-09-03 19:54:33,394 INFO L226 Difference]: Without dead ends: 258 [2019-09-03 19:54:33,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6621 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1507, Invalid=24575, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 19:54:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-03 19:54:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2019-09-03 19:54:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-03 19:54:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2019-09-03 19:54:33,413 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 246 [2019-09-03 19:54:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:33,413 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2019-09-03 19:54:33,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 19:54:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2019-09-03 19:54:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-03 19:54:33,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:33,415 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:33,415 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1853529304, now seen corresponding path program 58 times [2019-09-03 19:54:33,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:33,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:33,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:33,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:33,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 523 proven. 1307 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 19:54:34,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:34,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:34,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:34,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:34,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:34,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 19:54:34,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:36,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 57 proven. 1857 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-09-03 19:54:36,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:36,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 67] total 99 [2019-09-03 19:54:36,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 19:54:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 19:54:36,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1593, Invalid=8109, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:54:36,741 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 99 states. [2019-09-03 19:54:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:41,170 INFO L93 Difference]: Finished difference Result 263 states and 265 transitions. [2019-09-03 19:54:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 19:54:41,170 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 247 [2019-09-03 19:54:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:41,172 INFO L225 Difference]: With dead ends: 263 [2019-09-03 19:54:41,172 INFO L226 Difference]: Without dead ends: 261 [2019-09-03 19:54:41,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6530 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4574, Invalid=21186, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 19:54:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-03 19:54:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2019-09-03 19:54:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-03 19:54:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2019-09-03 19:54:41,189 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 247 [2019-09-03 19:54:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:41,189 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2019-09-03 19:54:41,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 19:54:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2019-09-03 19:54:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-03 19:54:41,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:41,191 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:41,191 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1598213039, now seen corresponding path program 59 times [2019-09-03 19:54:41,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:41,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:41,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:41,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 1365 proven. 556 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:54:45,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:45,143 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:54:45,153 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:45,266 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-03 19:54:45,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:45,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-03 19:54:45,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:48,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:48,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 146 proven. 1862 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-09-03 19:54:48,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:48,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70] total 103 [2019-09-03 19:54:48,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 19:54:48,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 19:54:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=9276, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 19:54:48,461 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 103 states. [2019-09-03 19:54:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:55,207 INFO L93 Difference]: Finished difference Result 485 states and 490 transitions. [2019-09-03 19:54:55,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 19:54:55,207 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 254 [2019-09-03 19:54:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:55,210 INFO L225 Difference]: With dead ends: 485 [2019-09-03 19:54:55,210 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 19:54:55,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3546 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1468, Invalid=17164, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 19:54:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 19:54:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2019-09-03 19:54:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-03 19:54:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2019-09-03 19:54:55,251 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 254 [2019-09-03 19:54:55,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:55,251 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2019-09-03 19:54:55,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 19:54:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2019-09-03 19:54:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-03 19:54:55,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:55,254 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:55,255 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:55,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1074441994, now seen corresponding path program 60 times [2019-09-03 19:54:55,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:55,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:55,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3693 backedges. 556 proven. 1397 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:54:57,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:57,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:57,232 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:57,344 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:54:57,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:57,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 19:54:57,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:59,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3693 backedges. 60 proven. 1893 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 19:54:59,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:59,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 101 [2019-09-03 19:54:59,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 19:54:59,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 19:54:59,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1690, Invalid=8410, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:54:59,451 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 101 states. [2019-09-03 19:55:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:03,630 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2019-09-03 19:55:03,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:55:03,631 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 255 [2019-09-03 19:55:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:03,633 INFO L225 Difference]: With dead ends: 271 [2019-09-03 19:55:03,633 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 19:55:03,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6512 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4791, Invalid=21615, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 19:55:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 19:55:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2019-09-03 19:55:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-03 19:55:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2019-09-03 19:55:03,658 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 255 [2019-09-03 19:55:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:03,658 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2019-09-03 19:55:03,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 19:55:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2019-09-03 19:55:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-03 19:55:03,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:03,660 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:03,660 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash -797386287, now seen corresponding path program 61 times [2019-09-03 19:55:03,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:03,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 1457 proven. 590 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:55:07,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:07,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:07,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:07,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-03 19:55:07,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:10,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:10,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:10,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:10,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 61 proven. 2076 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:55:11,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:11,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 72] total 106 [2019-09-03 19:55:11,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 19:55:11,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 19:55:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1301, Invalid=9829, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:55:11,107 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 106 states. [2019-09-03 19:55:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:17,320 INFO L93 Difference]: Finished difference Result 500 states and 505 transitions. [2019-09-03 19:55:17,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:55:17,321 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 262 [2019-09-03 19:55:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:17,323 INFO L225 Difference]: With dead ends: 500 [2019-09-03 19:55:17,323 INFO L226 Difference]: Without dead ends: 274 [2019-09-03 19:55:17,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3756 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1546, Invalid=18194, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 19:55:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-03 19:55:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2019-09-03 19:55:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-03 19:55:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2019-09-03 19:55:17,344 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 262 [2019-09-03 19:55:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:17,345 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2019-09-03 19:55:17,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 19:55:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2019-09-03 19:55:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-03 19:55:17,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:17,346 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:17,346 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:17,346 INFO L82 PathProgramCache]: Analyzing trace with hash 198256664, now seen corresponding path program 62 times [2019-09-03 19:55:17,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:17,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:17,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:17,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:17,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 590 proven. 1490 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:55:18,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:18,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:18,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:18,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:18,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:18,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 19:55:18,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:20,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 62 proven. 2018 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 19:55:20,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:20,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 104 [2019-09-03 19:55:20,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-03 19:55:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-03 19:55:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1792, Invalid=8920, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:55:20,902 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 104 states. [2019-09-03 19:55:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:24,913 INFO L93 Difference]: Finished difference Result 279 states and 281 transitions. [2019-09-03 19:55:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:55:24,914 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 263 [2019-09-03 19:55:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:24,915 INFO L225 Difference]: With dead ends: 279 [2019-09-03 19:55:24,916 INFO L226 Difference]: Without dead ends: 277 [2019-09-03 19:55:24,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6930 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5089, Invalid=22967, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 19:55:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-03 19:55:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2019-09-03 19:55:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-03 19:55:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2019-09-03 19:55:24,941 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 263 [2019-09-03 19:55:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:24,942 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2019-09-03 19:55:24,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-03 19:55:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2019-09-03 19:55:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-03 19:55:24,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:24,943 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:24,944 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1893013615, now seen corresponding path program 63 times [2019-09-03 19:55:24,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:24,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:24,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 1552 proven. 625 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 19:55:29,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:29,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:29,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:29,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 19:55:29,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:29,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-03 19:55:29,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:35,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:35,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:35,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 63 proven. 2207 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-09-03 19:55:35,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:35,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74] total 141 [2019-09-03 19:55:35,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 19:55:35,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 19:55:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1470, Invalid=18270, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 19:55:35,635 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 141 states. [2019-09-03 19:55:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:45,043 INFO L93 Difference]: Finished difference Result 515 states and 520 transitions. [2019-09-03 19:55:45,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:55:45,044 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 270 [2019-09-03 19:55:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:45,046 INFO L225 Difference]: With dead ends: 515 [2019-09-03 19:55:45,046 INFO L226 Difference]: Without dead ends: 282 [2019-09-03 19:55:45,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7926 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1753, Invalid=29399, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 19:55:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-03 19:55:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2019-09-03 19:55:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-03 19:55:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2019-09-03 19:55:45,069 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 270 [2019-09-03 19:55:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:45,069 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2019-09-03 19:55:45,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 19:55:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2019-09-03 19:55:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-03 19:55:45,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:45,070 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:45,070 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash -856019018, now seen corresponding path program 64 times [2019-09-03 19:55:45,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:45,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:45,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:45,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4195 backedges. 625 proven. 1586 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 19:55:46,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:46,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:46,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:46,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:46,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:46,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-03 19:55:46,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:48,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4195 backedges. 63 proven. 2241 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-09-03 19:55:48,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:48,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 73] total 108 [2019-09-03 19:55:48,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 19:55:48,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 19:55:48,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1899, Invalid=9657, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:55:48,937 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 108 states. [2019-09-03 19:55:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:53,164 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2019-09-03 19:55:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:55:53,165 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 271 [2019-09-03 19:55:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:53,167 INFO L225 Difference]: With dead ends: 287 [2019-09-03 19:55:53,167 INFO L226 Difference]: Without dead ends: 285 [2019-09-03 19:55:53,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7826 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5474, Invalid=25326, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 19:55:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-03 19:55:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-09-03 19:55:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-03 19:55:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2019-09-03 19:55:53,193 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 271 [2019-09-03 19:55:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:53,194 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2019-09-03 19:55:53,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 19:55:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2019-09-03 19:55:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-03 19:55:53,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:53,196 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:53,196 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash 79684369, now seen corresponding path program 65 times [2019-09-03 19:55:53,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:53,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:53,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:53,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 1650 proven. 661 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:55:57,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:57,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:57,824 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:57,947 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-03 19:55:57,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:57,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-03 19:55:57,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:01,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:01,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:01,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 161 proven. 2246 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-09-03 19:56:01,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:01,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 76] total 112 [2019-09-03 19:56:01,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 19:56:01,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 19:56:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1449, Invalid=10983, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:56:01,525 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 112 states. [2019-09-03 19:56:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:09,489 INFO L93 Difference]: Finished difference Result 530 states and 535 transitions. [2019-09-03 19:56:09,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:56:09,490 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 278 [2019-09-03 19:56:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:09,492 INFO L225 Difference]: With dead ends: 530 [2019-09-03 19:56:09,492 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 19:56:09,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4194 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1708, Invalid=20344, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 19:56:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 19:56:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2019-09-03 19:56:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-03 19:56:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 283 transitions. [2019-09-03 19:56:09,517 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 283 transitions. Word has length 278 [2019-09-03 19:56:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:09,517 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 283 transitions. [2019-09-03 19:56:09,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 19:56:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 283 transitions. [2019-09-03 19:56:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-03 19:56:09,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:09,519 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:09,519 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1327971496, now seen corresponding path program 66 times [2019-09-03 19:56:09,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:09,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:09,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:09,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4458 backedges. 661 proven. 1685 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:56:11,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:11,183 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:56:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:11,325 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-03 19:56:11,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:11,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-03 19:56:11,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4458 backedges. 66 proven. 2280 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 19:56:13,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:13,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 110 [2019-09-03 19:56:13,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-03 19:56:13,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-03 19:56:13,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2005, Invalid=9985, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:56:13,530 INFO L87 Difference]: Start difference. First operand 282 states and 283 transitions. Second operand 110 states. [2019-09-03 19:56:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:17,808 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2019-09-03 19:56:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:56:17,809 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 279 [2019-09-03 19:56:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:17,811 INFO L225 Difference]: With dead ends: 295 [2019-09-03 19:56:17,811 INFO L226 Difference]: Without dead ends: 293 [2019-09-03 19:56:17,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7805 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5712, Invalid=25794, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 19:56:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-03 19:56:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2019-09-03 19:56:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-03 19:56:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2019-09-03 19:56:17,834 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 279 [2019-09-03 19:56:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:17,834 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2019-09-03 19:56:17,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-03 19:56:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2019-09-03 19:56:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-03 19:56:17,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:17,836 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:17,836 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:17,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1268493009, now seen corresponding path program 67 times [2019-09-03 19:56:17,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:17,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:17,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 1751 proven. 698 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 19:56:22,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:22,722 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:56:22,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:22,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 19:56:22,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:26,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:26,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:26,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 67 proven. 2481 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-09-03 19:56:26,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:26,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78] total 115 [2019-09-03 19:56:26,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 19:56:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 19:56:26,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1526, Invalid=11584, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:56:26,573 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 115 states. [2019-09-03 19:56:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:35,460 INFO L93 Difference]: Finished difference Result 545 states and 550 transitions. [2019-09-03 19:56:35,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:56:35,460 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 286 [2019-09-03 19:56:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:35,462 INFO L225 Difference]: With dead ends: 545 [2019-09-03 19:56:35,462 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 19:56:35,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4422 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1792, Invalid=21464, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 19:56:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 19:56:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2019-09-03 19:56:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-03 19:56:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2019-09-03 19:56:35,483 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 286 [2019-09-03 19:56:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:35,483 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2019-09-03 19:56:35,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 19:56:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2019-09-03 19:56:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-03 19:56:35,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:35,484 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:35,485 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash -929563018, now seen corresponding path program 68 times [2019-09-03 19:56:35,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:35,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:35,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 698 proven. 1787 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 19:56:37,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:37,344 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:56:37,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:37,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:37,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:37,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 19:56:37,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:39,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 68 proven. 2417 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 19:56:39,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:39,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 113 [2019-09-03 19:56:39,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 19:56:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 19:56:39,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2116, Invalid=10540, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:56:39,786 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand 113 states. [2019-09-03 19:56:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:45,264 INFO L93 Difference]: Finished difference Result 303 states and 305 transitions. [2019-09-03 19:56:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:56:45,265 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 287 [2019-09-03 19:56:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:45,267 INFO L225 Difference]: With dead ends: 303 [2019-09-03 19:56:45,267 INFO L226 Difference]: Without dead ends: 301 [2019-09-03 19:56:45,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8262 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6037, Invalid=27269, Unknown=0, NotChecked=0, Total=33306 [2019-09-03 19:56:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-03 19:56:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2019-09-03 19:56:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-03 19:56:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2019-09-03 19:56:45,288 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 287 [2019-09-03 19:56:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:45,289 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2019-09-03 19:56:45,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 19:56:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2019-09-03 19:56:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-03 19:56:45,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:45,290 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:45,290 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1233124433, now seen corresponding path program 69 times [2019-09-03 19:56:45,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:45,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:45,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 1855 proven. 736 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 19:56:50,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:50,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 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:56:50,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:50,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 19:56:50,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:50,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-03 19:56:50,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:57,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:57,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:57,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:57,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 171 proven. 2522 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-09-03 19:56:57,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:57,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 80] total 153 [2019-09-03 19:56:57,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-03 19:56:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-03 19:56:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1710, Invalid=21546, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 19:56:57,704 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 153 states. [2019-09-03 19:57:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:09,938 INFO L93 Difference]: Finished difference Result 560 states and 565 transitions. [2019-09-03 19:57:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:57:09,939 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 294 [2019-09-03 19:57:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:09,941 INFO L225 Difference]: With dead ends: 560 [2019-09-03 19:57:09,941 INFO L226 Difference]: Without dead ends: 306 [2019-09-03 19:57:09,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9348 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2017, Invalid=34655, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 19:57:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-03 19:57:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2019-09-03 19:57:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-03 19:57:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2019-09-03 19:57:09,966 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 294 [2019-09-03 19:57:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:09,966 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2019-09-03 19:57:09,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-03 19:57:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2019-09-03 19:57:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-03 19:57:09,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:09,967 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:09,968 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash -956993896, now seen corresponding path program 70 times [2019-09-03 19:57:09,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:09,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:09,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:09,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:09,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5008 backedges. 736 proven. 1892 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 19:57:11,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:11,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 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:57:11,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:11,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:11,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:11,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:57:11,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:14,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5008 backedges. 69 proven. 2661 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-09-03 19:57:14,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:14,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 79] total 117 [2019-09-03 19:57:14,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 19:57:14,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 19:57:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=11340, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:57:14,496 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 117 states. [2019-09-03 19:57:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:20,186 INFO L93 Difference]: Finished difference Result 311 states and 313 transitions. [2019-09-03 19:57:20,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 19:57:20,187 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 295 [2019-09-03 19:57:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:20,189 INFO L225 Difference]: With dead ends: 311 [2019-09-03 19:57:20,189 INFO L226 Difference]: Without dead ends: 309 [2019-09-03 19:57:20,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9239 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6455, Invalid=29835, Unknown=0, NotChecked=0, Total=36290 [2019-09-03 19:57:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-03 19:57:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2019-09-03 19:57:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-03 19:57:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2019-09-03 19:57:20,215 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 295 [2019-09-03 19:57:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:20,216 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2019-09-03 19:57:20,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 19:57:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2019-09-03 19:57:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-03 19:57:20,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:20,218 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:20,218 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 671908335, now seen corresponding path program 71 times [2019-09-03 19:57:20,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:20,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:20,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 1962 proven. 775 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:57:25,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:25,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:25,514 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:25,651 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-03 19:57:25,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:25,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-03 19:57:25,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:29,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:29,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:29,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:29,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 176 proven. 2666 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-09-03 19:57:29,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:29,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82] total 121 [2019-09-03 19:57:29,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 19:57:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 19:57:29,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1686, Invalid=12834, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:57:29,771 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 121 states. [2019-09-03 19:57:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:37,530 INFO L93 Difference]: Finished difference Result 575 states and 580 transitions. [2019-09-03 19:57:37,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 19:57:37,531 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 302 [2019-09-03 19:57:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:37,533 INFO L225 Difference]: With dead ends: 575 [2019-09-03 19:57:37,533 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 19:57:37,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1966, Invalid=23794, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 19:57:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 19:57:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 306. [2019-09-03 19:57:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-03 19:57:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 307 transitions. [2019-09-03 19:57:37,566 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 307 transitions. Word has length 302 [2019-09-03 19:57:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:37,566 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 307 transitions. [2019-09-03 19:57:37,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 19:57:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 307 transitions. [2019-09-03 19:57:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-03 19:57:37,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:37,568 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:37,568 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash -118833866, now seen corresponding path program 72 times [2019-09-03 19:57:37,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:37,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:37,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5295 backedges. 775 proven. 2000 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:57:39,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:39,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:39,522 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:39,669 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:57:39,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:39,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 19:57:39,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:42,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5295 backedges. 72 proven. 2703 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 19:57:42,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:42,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 119 [2019-09-03 19:57:42,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-03 19:57:42,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-03 19:57:42,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2347, Invalid=11695, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 19:57:42,219 INFO L87 Difference]: Start difference. First operand 306 states and 307 transitions. Second operand 119 states. [2019-09-03 19:57:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:47,911 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2019-09-03 19:57:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:57:47,911 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 303 [2019-09-03 19:57:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:47,914 INFO L225 Difference]: With dead ends: 319 [2019-09-03 19:57:47,914 INFO L226 Difference]: Without dead ends: 317 [2019-09-03 19:57:47,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9215 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6714, Invalid=30342, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 19:57:47,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-03 19:57:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2019-09-03 19:57:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-03 19:57:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2019-09-03 19:57:47,938 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 303 [2019-09-03 19:57:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:47,938 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2019-09-03 19:57:47,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-03 19:57:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2019-09-03 19:57:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-03 19:57:47,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:47,940 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:47,940 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2128796271, now seen corresponding path program 73 times [2019-09-03 19:57:47,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:47,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:47,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:47,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 2072 proven. 815 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:57:53,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:53,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 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:57:53,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:53,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-03 19:57:53,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:57,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:57,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:57,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:57,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 73 proven. 2922 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-09-03 19:57:57,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:57,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 84] total 124 [2019-09-03 19:57:57,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-03 19:57:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-03 19:57:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1769, Invalid=13483, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 19:57:57,894 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 124 states. [2019-09-03 19:58:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:08,247 INFO L93 Difference]: Finished difference Result 590 states and 595 transitions. [2019-09-03 19:58:08,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:58:08,247 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 310 [2019-09-03 19:58:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:08,250 INFO L225 Difference]: With dead ends: 590 [2019-09-03 19:58:08,250 INFO L226 Difference]: Without dead ends: 322 [2019-09-03 19:58:08,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5142 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2056, Invalid=25004, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 19:58:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-03 19:58:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2019-09-03 19:58:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-03 19:58:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 315 transitions. [2019-09-03 19:58:08,310 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 315 transitions. Word has length 310 [2019-09-03 19:58:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:08,310 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 315 transitions. [2019-09-03 19:58:08,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-03 19:58:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 315 transitions. [2019-09-03 19:58:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-03 19:58:08,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:08,312 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:08,312 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2022386136, now seen corresponding path program 74 times [2019-09-03 19:58:08,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:08,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:08,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:08,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:08,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 815 proven. 2111 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:58:10,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:10,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:58:10,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:10,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:10,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:10,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-03 19:58:10,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:13,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 74 proven. 2852 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 19:58:13,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:13,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 122 [2019-09-03 19:58:13,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-03 19:58:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-03 19:58:13,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2467, Invalid=12295, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:58:13,196 INFO L87 Difference]: Start difference. First operand 314 states and 315 transitions. Second operand 122 states. [2019-09-03 19:58:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:19,123 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2019-09-03 19:58:19,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:58:19,123 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 311 [2019-09-03 19:58:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:19,125 INFO L225 Difference]: With dead ends: 327 [2019-09-03 19:58:19,125 INFO L226 Difference]: Without dead ends: 325 [2019-09-03 19:58:19,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9711 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7066, Invalid=31940, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 19:58:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-03 19:58:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2019-09-03 19:58:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-03 19:58:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2019-09-03 19:58:19,149 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 311 [2019-09-03 19:58:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:19,149 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2019-09-03 19:58:19,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-03 19:58:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2019-09-03 19:58:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-03 19:58:19,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:19,150 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:19,151 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:19,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash -387342673, now seen corresponding path program 75 times [2019-09-03 19:58:19,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:19,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:19,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:19,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:19,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 2185 proven. 856 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 19:58:24,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:24,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 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:58:24,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:25,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-03 19:58:25,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:25,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-03 19:58:25,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:32,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:32,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:32,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:33,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 75 proven. 3077 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-09-03 19:58:33,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:33,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 86] total 165 [2019-09-03 19:58:33,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-03 19:58:33,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-03 19:58:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1968, Invalid=25092, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 19:58:33,375 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 165 states. [2019-09-03 19:58:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:47,866 INFO L93 Difference]: Finished difference Result 605 states and 610 transitions. [2019-09-03 19:58:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:58:47,867 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 318 [2019-09-03 19:58:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:47,869 INFO L225 Difference]: With dead ends: 605 [2019-09-03 19:58:47,869 INFO L226 Difference]: Without dead ends: 330 [2019-09-03 19:58:47,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10887 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=2299, Invalid=40343, Unknown=0, NotChecked=0, Total=42642 [2019-09-03 19:58:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-03 19:58:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 322. [2019-09-03 19:58:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-03 19:58:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 323 transitions. [2019-09-03 19:58:47,893 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 323 transitions. Word has length 318 [2019-09-03 19:58:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:47,893 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 323 transitions. [2019-09-03 19:58:47,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-03 19:58:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 323 transitions. [2019-09-03 19:58:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-03 19:58:47,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:47,894 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:47,894 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:47,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:47,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1022465034, now seen corresponding path program 76 times [2019-09-03 19:58:47,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:47,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:47,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5893 backedges. 856 proven. 2225 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 19:58:50,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:50,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:58:50,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:50,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:50,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:50,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-03 19:58:50,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5893 backedges. 75 proven. 3117 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-09-03 19:58:53,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:53,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 85] total 126 [2019-09-03 19:58:53,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-03 19:58:53,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-03 19:58:53,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2592, Invalid=13158, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 19:58:53,024 INFO L87 Difference]: Start difference. First operand 322 states and 323 transitions. Second operand 126 states. [2019-09-03 19:58:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:59,627 INFO L93 Difference]: Finished difference Result 335 states and 337 transitions. [2019-09-03 19:58:59,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 19:58:59,627 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 319 [2019-09-03 19:58:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:59,630 INFO L225 Difference]: With dead ends: 335 [2019-09-03 19:58:59,630 INFO L226 Difference]: Without dead ends: 333 [2019-09-03 19:58:59,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10769 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7517, Invalid=34713, Unknown=0, NotChecked=0, Total=42230 [2019-09-03 19:58:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-03 19:58:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2019-09-03 19:58:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-03 19:58:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2019-09-03 19:58:59,654 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 319 [2019-09-03 19:58:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:59,654 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2019-09-03 19:58:59,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-03 19:58:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2019-09-03 19:58:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-03 19:58:59,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:59,656 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:59,656 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1896128815, now seen corresponding path program 77 times [2019-09-03 19:58:59,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:59,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:59,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:59,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:59,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 2301 proven. 898 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:59:05,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:05,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59:05,704 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:05,854 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-09-03 19:59:05,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:05,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-03 19:59:05,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:10,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:10,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:10,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:10,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 191 proven. 3122 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-09-03 19:59:10,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:10,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 88] total 130 [2019-09-03 19:59:10,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-03 19:59:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-03 19:59:10,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1941, Invalid=14829, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 19:59:10,610 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 130 states. [2019-09-03 19:59:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:21,833 INFO L93 Difference]: Finished difference Result 620 states and 625 transitions. [2019-09-03 19:59:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 19:59:21,833 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 326 [2019-09-03 19:59:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:21,836 INFO L225 Difference]: With dead ends: 620 [2019-09-03 19:59:21,836 INFO L226 Difference]: Without dead ends: 338 [2019-09-03 19:59:21,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5652 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=2242, Invalid=27514, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 19:59:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-03 19:59:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2019-09-03 19:59:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-03 19:59:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2019-09-03 19:59:21,861 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 326 [2019-09-03 19:59:21,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:21,862 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2019-09-03 19:59:21,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-03 19:59:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2019-09-03 19:59:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-03 19:59:21,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:21,864 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:21,864 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:21,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:21,864 INFO L82 PathProgramCache]: Analyzing trace with hash -251792104, now seen corresponding path program 78 times [2019-09-03 19:59:21,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:21,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:21,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:21,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6204 backedges. 898 proven. 2342 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:59:24,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:24,098 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:59:24,109 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:24,275 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-09-03 19:59:24,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:24,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-03 19:59:24,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6204 backedges. 78 proven. 3162 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 19:59:27,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:27,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 128 [2019-09-03 19:59:27,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-03 19:59:27,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-03 19:59:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2716, Invalid=13540, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 19:59:27,225 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 128 states. [2019-09-03 19:59:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:34,172 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2019-09-03 19:59:34,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:59:34,173 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 327 [2019-09-03 19:59:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:34,175 INFO L225 Difference]: With dead ends: 343 [2019-09-03 19:59:34,175 INFO L226 Difference]: Without dead ends: 341 [2019-09-03 19:59:34,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10742 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=7797, Invalid=35259, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 19:59:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-03 19:59:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2019-09-03 19:59:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-03 19:59:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2019-09-03 19:59:34,204 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 327 [2019-09-03 19:59:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:34,205 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2019-09-03 19:59:34,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-03 19:59:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2019-09-03 19:59:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-03 19:59:34,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:34,207 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:34,207 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:34,207 INFO L82 PathProgramCache]: Analyzing trace with hash -216552593, now seen corresponding path program 79 times [2019-09-03 19:59:34,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:34,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:34,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 2420 proven. 941 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 19:59:40,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:40,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 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:59:40,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:40,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 177 conjunts are in the unsatisfiable core [2019-09-03 19:59:40,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:45,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:45,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:45,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 79 proven. 3399 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-09-03 19:59:45,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:45,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 90] total 133 [2019-09-03 19:59:45,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 19:59:45,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 19:59:45,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2030, Invalid=15526, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 19:59:45,585 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 133 states. [2019-09-03 19:59:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:57,284 INFO L93 Difference]: Finished difference Result 635 states and 640 transitions. [2019-09-03 19:59:57,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 19:59:57,285 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 334 [2019-09-03 19:59:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:57,287 INFO L225 Difference]: With dead ends: 635 [2019-09-03 19:59:57,287 INFO L226 Difference]: Without dead ends: 346 [2019-09-03 19:59:57,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5916 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=2338, Invalid=28814, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 19:59:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-03 19:59:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 338. [2019-09-03 19:59:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-03 19:59:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 339 transitions. [2019-09-03 19:59:57,316 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 339 transitions. Word has length 334 [2019-09-03 19:59:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:57,316 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 339 transitions. [2019-09-03 19:59:57,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 19:59:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 339 transitions. [2019-09-03 19:59:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-03 19:59:57,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:57,318 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:57,318 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:57,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:57,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1797196470, now seen corresponding path program 80 times [2019-09-03 19:59:57,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:57,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:57,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6523 backedges. 941 proven. 2462 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 19:59:59,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:59,717 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:59:59,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:59,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:59,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:59,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 19:59:59,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:02,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6523 backedges. 80 proven. 3323 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:00:03,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:03,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 131 [2019-09-03 20:00:03,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-03 20:00:03,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-03 20:00:03,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2845, Invalid=14185, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 20:00:03,095 INFO L87 Difference]: Start difference. First operand 338 states and 339 transitions. Second operand 131 states. [2019-09-03 20:00:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:09,226 INFO L93 Difference]: Finished difference Result 351 states and 353 transitions. [2019-09-03 20:00:09,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:00:09,227 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 335 [2019-09-03 20:00:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:09,229 INFO L225 Difference]: With dead ends: 351 [2019-09-03 20:00:09,229 INFO L226 Difference]: Without dead ends: 349 [2019-09-03 20:00:09,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11277 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=8176, Invalid=36980, Unknown=0, NotChecked=0, Total=45156 [2019-09-03 20:00:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-03 20:00:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2019-09-03 20:00:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-03 20:00:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2019-09-03 20:00:09,267 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 335 [2019-09-03 20:00:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:09,268 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2019-09-03 20:00:09,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-03 20:00:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2019-09-03 20:00:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-03 20:00:09,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:09,270 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:09,271 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:09,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1753307119, now seen corresponding path program 81 times [2019-09-03 20:00:09,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:09,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:09,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:09,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 2542 proven. 985 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:00:15,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:15,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:00:15,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:16,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-03 20:00:16,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:16,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 182 conjunts are in the unsatisfiable core [2019-09-03 20:00:16,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:25,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:25,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:25,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:25,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 201 proven. 3446 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-09-03 20:00:25,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:25,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 92] total 177 [2019-09-03 20:00:25,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-03 20:00:25,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-03 20:00:25,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2244, Invalid=28908, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 20:00:25,729 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 177 states. [2019-09-03 20:00:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:38,202 INFO L93 Difference]: Finished difference Result 650 states and 655 transitions. [2019-09-03 20:00:38,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:00:38,203 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 342 [2019-09-03 20:00:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:38,205 INFO L225 Difference]: With dead ends: 650 [2019-09-03 20:00:38,205 INFO L226 Difference]: Without dead ends: 354 [2019-09-03 20:00:38,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 254 SyntacticMatches, 3 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12543 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=2599, Invalid=46463, Unknown=0, NotChecked=0, Total=49062 [2019-09-03 20:00:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-03 20:00:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 346. [2019-09-03 20:00:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-03 20:00:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 347 transitions. [2019-09-03 20:00:38,234 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 347 transitions. Word has length 342 [2019-09-03 20:00:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:38,234 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 347 transitions. [2019-09-03 20:00:38,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-03 20:00:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 347 transitions. [2019-09-03 20:00:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-03 20:00:38,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:38,236 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:38,236 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:38,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1666068392, now seen corresponding path program 82 times [2019-09-03 20:00:38,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:38,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:38,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:38,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:38,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6850 backedges. 985 proven. 2585 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:00:40,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:40,739 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 20:00:40,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:40,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:40,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:40,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 20:00:40,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6850 backedges. 81 proven. 3609 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-09-03 20:00:44,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:44,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 91] total 135 [2019-09-03 20:00:44,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 20:00:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 20:00:44,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2979, Invalid=15111, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:00:44,159 INFO L87 Difference]: Start difference. First operand 346 states and 347 transitions. Second operand 135 states. [2019-09-03 20:00:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:50,512 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2019-09-03 20:00:50,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 20:00:50,513 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 343 [2019-09-03 20:00:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:50,515 INFO L225 Difference]: With dead ends: 359 [2019-09-03 20:00:50,515 INFO L226 Difference]: Without dead ends: 357 [2019-09-03 20:00:50,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12416 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=8660, Invalid=39960, Unknown=0, NotChecked=0, Total=48620 [2019-09-03 20:00:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-03 20:00:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2019-09-03 20:00:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-03 20:00:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2019-09-03 20:00:50,544 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 343 [2019-09-03 20:00:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:50,544 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2019-09-03 20:00:50,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 20:00:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2019-09-03 20:00:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-03 20:00:50,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:50,547 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:50,547 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -508385233, now seen corresponding path program 83 times [2019-09-03 20:00:50,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:50,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:50,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 2667 proven. 1030 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:00:57,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:57,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:00:57,412 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:57,626 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-03 20:00:57,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:57,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 185 conjunts are in the unsatisfiable core [2019-09-03 20:00:57,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:02,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:02,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:02,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:02,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 101 proven. 3719 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-09-03 20:01:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:03,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 94] total 139 [2019-09-03 20:01:03,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 20:01:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 20:01:03,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=16968, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:01:03,016 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 139 states. [2019-09-03 20:01:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:14,641 INFO L93 Difference]: Finished difference Result 665 states and 670 transitions. [2019-09-03 20:01:14,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:01:14,642 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 350 [2019-09-03 20:01:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:14,644 INFO L225 Difference]: With dead ends: 665 [2019-09-03 20:01:14,644 INFO L226 Difference]: Without dead ends: 362 [2019-09-03 20:01:14,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6462 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=2536, Invalid=31504, Unknown=0, NotChecked=0, Total=34040 [2019-09-03 20:01:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-03 20:01:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 354. [2019-09-03 20:01:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-03 20:01:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 355 transitions. [2019-09-03 20:01:14,673 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 355 transitions. Word has length 350 [2019-09-03 20:01:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:14,673 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 355 transitions. [2019-09-03 20:01:14,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 20:01:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 355 transitions. [2019-09-03 20:01:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-03 20:01:14,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:14,674 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:14,674 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:14,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:14,675 INFO L82 PathProgramCache]: Analyzing trace with hash -734488202, now seen corresponding path program 84 times [2019-09-03 20:01:14,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:14,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:14,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:14,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:14,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 1030 proven. 2711 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:01:17,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:17,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 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 20:01:17,285 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:17,466 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 20:01:17,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:17,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 20:01:17,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:20,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 101 proven. 3763 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-09-03 20:01:20,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:20,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 93] total 138 [2019-09-03 20:01:20,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-03 20:01:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-03 20:01:20,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3114, Invalid=15792, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:01:20,940 INFO L87 Difference]: Start difference. First operand 354 states and 355 transitions. Second operand 138 states. [2019-09-03 20:01:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:28,454 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2019-09-03 20:01:28,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 20:01:28,454 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 351 [2019-09-03 20:01:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:28,457 INFO L225 Difference]: With dead ends: 367 [2019-09-03 20:01:28,457 INFO L226 Difference]: Without dead ends: 365 [2019-09-03 20:01:28,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12985 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=9059, Invalid=41791, Unknown=0, NotChecked=0, Total=50850 [2019-09-03 20:01:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-03 20:01:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2019-09-03 20:01:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-03 20:01:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2019-09-03 20:01:28,487 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 351 [2019-09-03 20:01:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:28,487 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2019-09-03 20:01:28,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-03 20:01:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2019-09-03 20:01:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-03 20:01:28,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:28,489 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:28,489 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1074463057, now seen corresponding path program 85 times [2019-09-03 20:01:28,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:28,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:28,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 2795 proven. 1076 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:01:35,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:35,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:01:35,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:35,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 189 conjunts are in the unsatisfiable core [2019-09-03 20:01:35,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:40,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:40,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:41,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 85 proven. 3912 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-09-03 20:01:41,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:41,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 96] total 142 [2019-09-03 20:01:41,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-03 20:01:41,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-03 20:01:41,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2309, Invalid=17713, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:01:41,331 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 142 states. [2019-09-03 20:01:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:52,071 INFO L93 Difference]: Finished difference Result 680 states and 685 transitions. [2019-09-03 20:01:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:01:52,072 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 358 [2019-09-03 20:01:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:52,075 INFO L225 Difference]: With dead ends: 680 [2019-09-03 20:01:52,075 INFO L226 Difference]: Without dead ends: 370 [2019-09-03 20:01:52,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6744 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=2638, Invalid=32894, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 20:01:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-03 20:01:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2019-09-03 20:01:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-03 20:01:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2019-09-03 20:01:52,115 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 358 [2019-09-03 20:01:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:52,116 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2019-09-03 20:01:52,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-03 20:01:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2019-09-03 20:01:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-09-03 20:01:52,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:52,118 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:52,118 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1762311064, now seen corresponding path program 86 times [2019-09-03 20:01:52,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:52,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:52,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:52,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 1076 proven. 2840 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:01:54,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:54,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:01:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:01:54,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:54,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:54,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-03 20:01:54,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:58,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 85 proven. 3957 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-09-03 20:01:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 95] total 141 [2019-09-03 20:01:58,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 20:01:58,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 20:01:58,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=16488, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 20:01:58,529 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 141 states. [2019-09-03 20:02:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:05,535 INFO L93 Difference]: Finished difference Result 375 states and 377 transitions. [2019-09-03 20:02:05,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 20:02:05,536 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 359 [2019-09-03 20:02:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:05,538 INFO L225 Difference]: With dead ends: 375 [2019-09-03 20:02:05,538 INFO L226 Difference]: Without dead ends: 373 [2019-09-03 20:02:05,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13579 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=9467, Invalid=43663, Unknown=0, NotChecked=0, Total=53130 [2019-09-03 20:02:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-03 20:02:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2019-09-03 20:02:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-03 20:02:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2019-09-03 20:02:05,568 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 359 [2019-09-03 20:02:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:05,569 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2019-09-03 20:02:05,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 20:02:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2019-09-03 20:02:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-03 20:02:05,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:05,570 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:05,570 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1361668881, now seen corresponding path program 87 times [2019-09-03 20:02:05,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:05,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:05,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:05,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 2926 proven. 1123 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:02:13,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:13,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 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 20:02:13,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:13,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 20:02:13,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:13,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 194 conjunts are in the unsatisfiable core [2019-09-03 20:02:13,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:23,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:23,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 87 proven. 4091 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-09-03 20:02:24,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:24,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 189 [2019-09-03 20:02:24,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 189 states [2019-09-03 20:02:24,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2019-09-03 20:02:24,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2538, Invalid=32994, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 20:02:24,107 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 189 states. [2019-09-03 20:02:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:42,124 INFO L93 Difference]: Finished difference Result 695 states and 700 transitions. [2019-09-03 20:02:42,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:02:42,125 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 366 [2019-09-03 20:02:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:42,127 INFO L225 Difference]: With dead ends: 695 [2019-09-03 20:02:42,127 INFO L226 Difference]: Without dead ends: 378 [2019-09-03 20:02:42,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 272 SyntacticMatches, 3 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14316 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=2917, Invalid=53015, Unknown=0, NotChecked=0, Total=55932 [2019-09-03 20:02:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-03 20:02:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-09-03 20:02:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-03 20:02:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 371 transitions. [2019-09-03 20:02:42,159 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 371 transitions. Word has length 366 [2019-09-03 20:02:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:42,159 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 371 transitions. [2019-09-03 20:02:42,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 189 states. [2019-09-03 20:02:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 371 transitions. [2019-09-03 20:02:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-03 20:02:42,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:42,160 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:42,161 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1081546806, now seen corresponding path program 88 times [2019-09-03 20:02:42,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:42,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:42,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7879 backedges. 1123 proven. 2972 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:02:44,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:44,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 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 20:02:44,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:02:45,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:45,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:45,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-03 20:02:45,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:48,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7879 backedges. 87 proven. 4137 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-09-03 20:02:48,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:48,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 97] total 144 [2019-09-03 20:02:48,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-03 20:02:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-03 20:02:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3393, Invalid=17199, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:02:48,801 INFO L87 Difference]: Start difference. First operand 370 states and 371 transitions. Second operand 144 states.