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/float-benchs/zonotope_3.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:16:06,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:16:06,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:16:06,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:16:06,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:16:06,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:16:06,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:16:06,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:16:06,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:16:06,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:16:06,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:16:06,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:16:06,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:16:06,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:16:06,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:16:06,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:16:06,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:16:06,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:16:06,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:16:06,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:16:06,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:16:06,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:16:06,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:16:06,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:16:06,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:16:06,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:16:06,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:16:06,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:16:06,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:16:06,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:16:06,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:16:06,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:16:06,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:16:06,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:16:06,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:16:06,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:16:06,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:16:06,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:16:06,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:16:06,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:16:06,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:16:06,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:16:06,742 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:16:06,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:16:06,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:16:06,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:16:06,744 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:16:06,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:16:06,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:16:06,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:16:06,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:16:06,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:16:06,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:16:06,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:16:06,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:16:06,746 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:16:06,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:16:06,746 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:16:06,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:16:06,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:16:06,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:16:06,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:16:06,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:16:06,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:16:06,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:16:06,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:16:06,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:16:06,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:16:06,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:16:06,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:16:06,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:16:06,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:16:06,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:16:06,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:16:06,795 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:16:06,795 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:16:06,796 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_3.c.p+cfa-reducer.c [2019-09-08 01:16:06,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8f599b1/1dd05712c0c14831bf8538397450c75e/FLAG1e76d74a0 [2019-09-08 01:16:07,348 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:16:07,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_3.c.p+cfa-reducer.c [2019-09-08 01:16:07,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8f599b1/1dd05712c0c14831bf8538397450c75e/FLAG1e76d74a0 [2019-09-08 01:16:07,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8f599b1/1dd05712c0c14831bf8538397450c75e [2019-09-08 01:16:07,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:16:07,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:16:07,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:16:07,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:16:07,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:16:07,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:16:07" (1/1) ... [2019-09-08 01:16:07,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@83b076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:07, skipping insertion in model container [2019-09-08 01:16:07,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:16:07" (1/1) ... [2019-09-08 01:16:07,726 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:16:07,753 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:16:07,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:16:07,978 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:16:08,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:16:08,042 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:16:08,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08 WrapperNode [2019-09-08 01:16:08,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:16:08,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:16:08,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:16:08,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:16:08,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (1/1) ... [2019-09-08 01:16:08,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (1/1) ... [2019-09-08 01:16:08,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (1/1) ... [2019-09-08 01:16:08,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (1/1) ... [2019-09-08 01:16:08,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (1/1) ... [2019-09-08 01:16:08,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (1/1) ... [2019-09-08 01:16:08,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (1/1) ... [2019-09-08 01:16:08,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:16:08,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:16:08,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:16:08,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:16:08,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:16:08,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:16:08,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:16:08,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-08 01:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 01:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 01:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-09-08 01:16:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-09-08 01:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:16:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:16:08,504 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:16:08,505 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 01:16:08,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:16:08 BoogieIcfgContainer [2019-09-08 01:16:08,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:16:08,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:16:08,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:16:08,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:16:08,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:16:07" (1/3) ... [2019-09-08 01:16:08,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef42bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:16:08, skipping insertion in model container [2019-09-08 01:16:08,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:16:08" (2/3) ... [2019-09-08 01:16:08,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef42bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:16:08, skipping insertion in model container [2019-09-08 01:16:08,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:16:08" (3/3) ... [2019-09-08 01:16:08,514 INFO L109 eAbstractionObserver]: Analyzing ICFG zonotope_3.c.p+cfa-reducer.c [2019-09-08 01:16:08,525 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:16:08,533 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:16:08,572 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:16:08,606 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:16:08,607 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:16:08,607 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:16:08,608 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:16:08,608 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:16:08,608 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:16:08,608 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:16:08,608 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:16:08,608 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:16:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-08 01:16:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 01:16:08,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:08,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:08,634 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1089057176, now seen corresponding path program 1 times [2019-09-08 01:16:08,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:08,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:08,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:08,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:08,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:16:08,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:16:08,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:16:08,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:16:08,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:16:08,834 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-09-08 01:16:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:08,869 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-09-08 01:16:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:16:08,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-08 01:16:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:08,881 INFO L225 Difference]: With dead ends: 40 [2019-09-08 01:16:08,881 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 01:16:08,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:16:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 01:16:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-09-08 01:16:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 01:16:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-08 01:16:08,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2019-09-08 01:16:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:08,926 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-08 01:16:08,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:16:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-08 01:16:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 01:16:08,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:08,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:08,928 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:08,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1091320956, now seen corresponding path program 1 times [2019-09-08 01:16:08,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:08,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:08,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:09,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:16:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:16:09,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:16:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:16:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:16:09,009 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-09-08 01:16:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:09,034 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-09-08 01:16:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:16:09,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-08 01:16:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:09,036 INFO L225 Difference]: With dead ends: 32 [2019-09-08 01:16:09,036 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 01:16:09,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:16:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 01:16:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 01:16:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 01:16:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-08 01:16:09,042 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2019-09-08 01:16:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:09,043 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-08 01:16:09,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:16:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-08 01:16:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 01:16:09,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:09,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:09,044 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:09,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:09,045 INFO L82 PathProgramCache]: Analyzing trace with hash -62186081, now seen corresponding path program 1 times [2019-09-08 01:16:09,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:09,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:09,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:09,150 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-08 01:16:09,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:09,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:09,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:09,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:16:09,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:09,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:09,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 01:16:09,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:16:09,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:16:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:16:09,290 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2019-09-08 01:16:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:09,334 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-08 01:16:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:16:09,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-08 01:16:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:09,336 INFO L225 Difference]: With dead ends: 32 [2019-09-08 01:16:09,336 INFO L226 Difference]: Without dead ends: 25 [2019-09-08 01:16:09,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:16:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-08 01:16:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-09-08 01:16:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 01:16:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-08 01:16:09,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2019-09-08 01:16:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:09,343 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-08 01:16:09,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:16:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-08 01:16:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:16:09,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:09,344 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:09,344 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 293154342, now seen corresponding path program 2 times [2019-09-08 01:16:09,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:09,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:09,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:09,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:09,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:09,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:09,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:09,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 01:16:09,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:09,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:16:09,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:16:09,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 01:16:09,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 01:16:09,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:16:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:16:09,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:16:09,507 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2019-09-08 01:16:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:09,562 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-08 01:16:09,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:16:09,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-08 01:16:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:09,565 INFO L225 Difference]: With dead ends: 38 [2019-09-08 01:16:09,566 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 01:16:09,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:16:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 01:16:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-09-08 01:16:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 01:16:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-09-08 01:16:09,572 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2019-09-08 01:16:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:09,573 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-09-08 01:16:09,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:16:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-09-08 01:16:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:16:09,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:09,576 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:09,576 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash -915137710, now seen corresponding path program 1 times [2019-09-08 01:16:09,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:09,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:09,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:09,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:09,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:09,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:16:09,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:09,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:09,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 01:16:09,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:16:09,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:16:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:16:09,795 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2019-09-08 01:16:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:09,845 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-08 01:16:09,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:16:09,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-09-08 01:16:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:09,848 INFO L225 Difference]: With dead ends: 40 [2019-09-08 01:16:09,848 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 01:16:09,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:16:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 01:16:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-09-08 01:16:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 01:16:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-08 01:16:09,860 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2019-09-08 01:16:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:09,860 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-08 01:16:09,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:16:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-08 01:16:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:16:09,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:09,862 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:09,862 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1202238681, now seen corresponding path program 2 times [2019-09-08 01:16:09,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:09,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:09,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:09,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:09,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:09,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:10,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:10,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:10,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:16:10,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:10,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 01:16:10,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:16:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:16:10,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:16:10,085 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2019-09-08 01:16:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:10,121 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-08 01:16:10,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:16:10,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-08 01:16:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:10,123 INFO L225 Difference]: With dead ends: 44 [2019-09-08 01:16:10,123 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 01:16:10,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:16:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 01:16:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-09-08 01:16:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 01:16:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-09-08 01:16:10,129 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2019-09-08 01:16:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:10,130 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-09-08 01:16:10,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:16:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-09-08 01:16:10,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 01:16:10,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:10,131 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:10,132 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:10,132 INFO L82 PathProgramCache]: Analyzing trace with hash -11062560, now seen corresponding path program 3 times [2019-09-08 01:16:10,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:10,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:10,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:10,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:10,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:10,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:10,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:10,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:10,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 01:16:10,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:10,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:16:10,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:10,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:10,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 01:16:10,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:16:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:16:10,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:16:10,320 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 8 states. [2019-09-08 01:16:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:10,349 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-08 01:16:10,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:16:10,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-09-08 01:16:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:10,350 INFO L225 Difference]: With dead ends: 48 [2019-09-08 01:16:10,351 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 01:16:10,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:16:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 01:16:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-09-08 01:16:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 01:16:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-09-08 01:16:10,357 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2019-09-08 01:16:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:10,357 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-09-08 01:16:10,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:16:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-09-08 01:16:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 01:16:10,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:10,359 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:10,360 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 536434023, now seen corresponding path program 4 times [2019-09-08 01:16:10,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:10,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:10,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:10,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:10,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:10,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:10,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:10,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:10,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:10,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:16:10,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:10,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:10,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 01:16:10,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:16:10,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:16:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:16:10,631 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2019-09-08 01:16:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:10,678 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-08 01:16:10,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:16:10,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-09-08 01:16:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:10,680 INFO L225 Difference]: With dead ends: 52 [2019-09-08 01:16:10,680 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 01:16:10,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:16:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 01:16:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-09-08 01:16:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 01:16:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-08 01:16:10,687 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2019-09-08 01:16:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:10,687 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-08 01:16:10,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:16:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-08 01:16:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:16:10,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:10,689 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:10,689 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 103341166, now seen corresponding path program 5 times [2019-09-08 01:16:10,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:10,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:10,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:10,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:10,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:10,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:10,926 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-08 01:16:10,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:10,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:16:10,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:10,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:10,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 01:16:10,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:16:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:16:10,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:16:10,957 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 10 states. [2019-09-08 01:16:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:11,006 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-09-08 01:16:11,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:16:11,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-09-08 01:16:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:11,007 INFO L225 Difference]: With dead ends: 56 [2019-09-08 01:16:11,007 INFO L226 Difference]: Without dead ends: 49 [2019-09-08 01:16:11,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:16:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-08 01:16:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-09-08 01:16:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 01:16:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-09-08 01:16:11,014 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2019-09-08 01:16:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:11,014 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-09-08 01:16:11,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:16:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-09-08 01:16:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:16:11,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:11,016 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:11,016 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1415608331, now seen corresponding path program 6 times [2019-09-08 01:16:11,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:11,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:11,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:11,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:11,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:11,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:11,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:11,164 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:11,252 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-08 01:16:11,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:11,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:16:11,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 01:16:11,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:16:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:16:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:16:11,300 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 11 states. [2019-09-08 01:16:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:11,384 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-08 01:16:11,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:16:11,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-09-08 01:16:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:11,387 INFO L225 Difference]: With dead ends: 60 [2019-09-08 01:16:11,387 INFO L226 Difference]: Without dead ends: 53 [2019-09-08 01:16:11,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:16:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-08 01:16:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-09-08 01:16:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-08 01:16:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-08 01:16:11,401 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2019-09-08 01:16:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:11,402 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-08 01:16:11,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:16:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-08 01:16:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 01:16:11,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:11,405 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:11,406 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:11,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:11,406 INFO L82 PathProgramCache]: Analyzing trace with hash 389486588, now seen corresponding path program 7 times [2019-09-08 01:16:11,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:11,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:11,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:11,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:11,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:11,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:11,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:11,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:16:11,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:11,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:11,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 01:16:11,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:16:11,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:16:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:16:11,692 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 12 states. [2019-09-08 01:16:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:11,756 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-09-08 01:16:11,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:16:11,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-09-08 01:16:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:11,759 INFO L225 Difference]: With dead ends: 64 [2019-09-08 01:16:11,759 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 01:16:11,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:16:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 01:16:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-09-08 01:16:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 01:16:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-08 01:16:11,769 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2019-09-08 01:16:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:11,770 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-08 01:16:11,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:16:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-08 01:16:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 01:16:11,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:11,773 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:11,774 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:11,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash -857125757, now seen corresponding path program 8 times [2019-09-08 01:16:11,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:11,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:11,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:11,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:11,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:12,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:12,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:12,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:16:12,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:12,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:12,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 01:16:12,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:16:12,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:16:12,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:16:12,059 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 13 states. [2019-09-08 01:16:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:12,104 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-09-08 01:16:12,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:16:12,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-09-08 01:16:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:12,106 INFO L225 Difference]: With dead ends: 68 [2019-09-08 01:16:12,106 INFO L226 Difference]: Without dead ends: 61 [2019-09-08 01:16:12,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:16:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-08 01:16:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-09-08 01:16:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 01:16:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-08 01:16:12,119 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2019-09-08 01:16:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:12,120 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-08 01:16:12,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:16:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-08 01:16:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 01:16:12,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:12,125 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:12,125 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:12,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1037034890, now seen corresponding path program 9 times [2019-09-08 01:16:12,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:12,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:12,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:12,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:12,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:12,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:12,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:12,330 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-08 01:16:12,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-08 01:16:12,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:12,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:16:12,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:12,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:12,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-08 01:16:12,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:16:12,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:16:12,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:16:12,452 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 14 states. [2019-09-08 01:16:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:12,501 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-09-08 01:16:12,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 01:16:12,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-09-08 01:16:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:12,503 INFO L225 Difference]: With dead ends: 72 [2019-09-08 01:16:12,503 INFO L226 Difference]: Without dead ends: 65 [2019-09-08 01:16:12,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:16:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-08 01:16:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-09-08 01:16:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-08 01:16:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-09-08 01:16:12,509 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 56 [2019-09-08 01:16:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:12,509 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-09-08 01:16:12,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:16:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-09-08 01:16:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 01:16:12,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:12,511 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:12,511 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 941925137, now seen corresponding path program 10 times [2019-09-08 01:16:12,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:12,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:12,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:12,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:12,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:12,688 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-08 01:16:12,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:12,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:12,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:16:12,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:12,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:12,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 01:16:12,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 01:16:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 01:16:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:16:12,837 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 15 states. [2019-09-08 01:16:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:12,890 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-09-08 01:16:12,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:16:12,890 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-09-08 01:16:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:12,891 INFO L225 Difference]: With dead ends: 76 [2019-09-08 01:16:12,892 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 01:16:12,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:16:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 01:16:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-09-08 01:16:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-08 01:16:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-08 01:16:12,899 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2019-09-08 01:16:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:12,899 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-08 01:16:12,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 01:16:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-08 01:16:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 01:16:12,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:12,900 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:12,901 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1463895320, now seen corresponding path program 11 times [2019-09-08 01:16:12,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:12,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:12,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:13,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:13,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:13,073 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:13,181 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-08 01:16:13,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:13,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 01:16:13,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:13,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:13,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-08 01:16:13,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:16:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:16:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:16:13,215 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 16 states. [2019-09-08 01:16:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:13,274 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-09-08 01:16:13,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:16:13,275 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2019-09-08 01:16:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:13,276 INFO L225 Difference]: With dead ends: 80 [2019-09-08 01:16:13,276 INFO L226 Difference]: Without dead ends: 73 [2019-09-08 01:16:13,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:16:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-08 01:16:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2019-09-08 01:16:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-08 01:16:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-09-08 01:16:13,288 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2019-09-08 01:16:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:13,288 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-09-08 01:16:13,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:16:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-09-08 01:16:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 01:16:13,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:13,291 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:13,292 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1939835807, now seen corresponding path program 12 times [2019-09-08 01:16:13,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:13,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:13,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:13,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:13,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:13,499 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-08 01:16:13,517 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-08 01:16:13,652 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-09-08 01:16:13,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:13,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 01:16:13,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:13,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:13,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-08 01:16:13,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:16:13,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:16:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:16:13,691 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 17 states. [2019-09-08 01:16:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:13,776 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-09-08 01:16:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:16:13,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-09-08 01:16:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:13,778 INFO L225 Difference]: With dead ends: 84 [2019-09-08 01:16:13,778 INFO L226 Difference]: Without dead ends: 77 [2019-09-08 01:16:13,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:16:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-08 01:16:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2019-09-08 01:16:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-08 01:16:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-08 01:16:13,790 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 68 [2019-09-08 01:16:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:13,791 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-08 01:16:13,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:16:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-08 01:16:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 01:16:13,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:13,796 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:13,796 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash 316225190, now seen corresponding path program 13 times [2019-09-08 01:16:13,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:13,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:13,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:14,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:14,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:14,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:14,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:16:14,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:14,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:14,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-08 01:16:14,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 01:16:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 01:16:14,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:16:14,280 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 18 states. [2019-09-08 01:16:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:14,359 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-09-08 01:16:14,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 01:16:14,360 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-09-08 01:16:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:14,361 INFO L225 Difference]: With dead ends: 88 [2019-09-08 01:16:14,361 INFO L226 Difference]: Without dead ends: 81 [2019-09-08 01:16:14,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:16:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-08 01:16:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-09-08 01:16:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-08 01:16:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-08 01:16:14,366 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 72 [2019-09-08 01:16:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:14,366 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-08 01:16:14,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 01:16:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-08 01:16:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 01:16:14,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:14,368 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:14,368 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash -676854227, now seen corresponding path program 14 times [2019-09-08 01:16:14,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:14,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:14,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:14,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:14,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:14,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:14,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:14,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:14,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:14,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:14,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 01:16:14,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:14,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:14,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-08 01:16:14,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 01:16:14,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 01:16:14,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:16:14,754 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 19 states. [2019-09-08 01:16:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:14,831 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-09-08 01:16:14,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:16:14,831 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2019-09-08 01:16:14,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:14,832 INFO L225 Difference]: With dead ends: 92 [2019-09-08 01:16:14,832 INFO L226 Difference]: Without dead ends: 85 [2019-09-08 01:16:14,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:16:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-08 01:16:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-09-08 01:16:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-08 01:16:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-09-08 01:16:14,837 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 76 [2019-09-08 01:16:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:14,837 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-09-08 01:16:14,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 01:16:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-09-08 01:16:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 01:16:14,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:14,838 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:14,838 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:14,839 INFO L82 PathProgramCache]: Analyzing trace with hash -236602828, now seen corresponding path program 15 times [2019-09-08 01:16:14,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:14,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:14,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:14,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:14,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:15,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:15,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:16:15,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:15,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-08 01:16:15,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:15,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 01:16:15,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:15,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:15,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-08 01:16:15,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:16:15,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:16:15,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:16:15,255 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 20 states. [2019-09-08 01:16:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:15,335 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-09-08 01:16:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:16:15,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2019-09-08 01:16:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:15,337 INFO L225 Difference]: With dead ends: 96 [2019-09-08 01:16:15,337 INFO L226 Difference]: Without dead ends: 89 [2019-09-08 01:16:15,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:16:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-08 01:16:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-09-08 01:16:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-08 01:16:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-09-08 01:16:15,342 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2019-09-08 01:16:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:15,342 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-09-08 01:16:15,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:16:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-09-08 01:16:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 01:16:15,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:15,343 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:15,344 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1903422789, now seen corresponding path program 16 times [2019-09-08 01:16:15,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:15,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:15,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:15,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:15,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:16:15,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:15,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:15,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:15,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 01:16:15,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:15,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:15,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-08 01:16:15,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:16:15,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:16:15,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:16:15,748 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 21 states. [2019-09-08 01:16:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:15,811 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-09-08 01:16:15,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:16:15,811 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2019-09-08 01:16:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:15,812 INFO L225 Difference]: With dead ends: 100 [2019-09-08 01:16:15,812 INFO L226 Difference]: Without dead ends: 93 [2019-09-08 01:16:15,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:16:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-08 01:16:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-09-08 01:16:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-08 01:16:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-09-08 01:16:15,818 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 84 [2019-09-08 01:16:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:15,819 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-09-08 01:16:15,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:16:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-09-08 01:16:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 01:16:15,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:15,820 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:15,820 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1203032002, now seen corresponding path program 17 times [2019-09-08 01:16:15,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:15,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:15,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:16,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:16,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:16,135 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:16,261 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-08 01:16:16,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:16,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 01:16:16,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:16,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:16,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-08 01:16:16,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 01:16:16,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 01:16:16,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:16:16,297 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 22 states. [2019-09-08 01:16:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:16,368 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2019-09-08 01:16:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 01:16:16,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2019-09-08 01:16:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:16,369 INFO L225 Difference]: With dead ends: 104 [2019-09-08 01:16:16,370 INFO L226 Difference]: Without dead ends: 97 [2019-09-08 01:16:16,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:16:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-08 01:16:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2019-09-08 01:16:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-08 01:16:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-09-08 01:16:16,376 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 88 [2019-09-08 01:16:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:16,377 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-09-08 01:16:16,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 01:16:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-09-08 01:16:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 01:16:16,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:16,378 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:16,378 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1801866935, now seen corresponding path program 18 times [2019-09-08 01:16:16,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:16,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:16,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:16,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:16,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:16,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:16,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:16,880 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-09-08 01:16:16,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:16,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 01:16:16,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:16,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:16,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-08 01:16:16,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 01:16:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 01:16:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:16:16,914 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 23 states. [2019-09-08 01:16:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:16,990 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-09-08 01:16:16,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:16:16,993 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 92 [2019-09-08 01:16:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:16,994 INFO L225 Difference]: With dead ends: 108 [2019-09-08 01:16:16,994 INFO L226 Difference]: Without dead ends: 101 [2019-09-08 01:16:16,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:16:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-08 01:16:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-09-08 01:16:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-08 01:16:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-09-08 01:16:16,999 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 92 [2019-09-08 01:16:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:16,999 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-09-08 01:16:17,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 01:16:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-09-08 01:16:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 01:16:17,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:17,001 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:17,001 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash 966031184, now seen corresponding path program 19 times [2019-09-08 01:16:17,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:17,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:17,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:17,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:17,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:16:17,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:17,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:16:17,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:17,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:17,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-08 01:16:17,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 01:16:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 01:16:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:16:17,452 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 24 states. [2019-09-08 01:16:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:17,528 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-09-08 01:16:17,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:16:17,528 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 96 [2019-09-08 01:16:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:17,529 INFO L225 Difference]: With dead ends: 112 [2019-09-08 01:16:17,530 INFO L226 Difference]: Without dead ends: 105 [2019-09-08 01:16:17,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:16:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-08 01:16:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-09-08 01:16:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-08 01:16:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-08 01:16:17,534 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 96 [2019-09-08 01:16:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:17,535 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-08 01:16:17,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 01:16:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-08 01:16:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 01:16:17,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:17,536 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:17,536 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:17,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:17,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1205935657, now seen corresponding path program 20 times [2019-09-08 01:16:17,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:17,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:17,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:17,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:17,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:17,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:18,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:18,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:18,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 01:16:18,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:18,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:18,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-08 01:16:18,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 01:16:18,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 01:16:18,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:16:18,208 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 25 states. [2019-09-08 01:16:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:18,302 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2019-09-08 01:16:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 01:16:18,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2019-09-08 01:16:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:18,304 INFO L225 Difference]: With dead ends: 116 [2019-09-08 01:16:18,304 INFO L226 Difference]: Without dead ends: 109 [2019-09-08 01:16:18,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:16:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-08 01:16:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-09-08 01:16:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-08 01:16:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-09-08 01:16:18,311 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 100 [2019-09-08 01:16:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:18,311 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-09-08 01:16:18,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 01:16:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-09-08 01:16:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 01:16:18,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:18,313 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:18,313 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1093488418, now seen corresponding path program 21 times [2019-09-08 01:16:18,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:18,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:18,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:18,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:18,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:18,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:18,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-08 01:16:18,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:18,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 01:16:18,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:18,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:18,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-08 01:16:18,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 01:16:18,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 01:16:18,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:16:18,924 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 26 states. [2019-09-08 01:16:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:18,998 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-09-08 01:16:18,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 01:16:18,999 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2019-09-08 01:16:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:19,000 INFO L225 Difference]: With dead ends: 120 [2019-09-08 01:16:19,000 INFO L226 Difference]: Without dead ends: 113 [2019-09-08 01:16:19,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:16:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-08 01:16:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-09-08 01:16:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-08 01:16:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-09-08 01:16:19,006 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 104 [2019-09-08 01:16:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:19,007 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-09-08 01:16:19,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 01:16:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-09-08 01:16:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 01:16:19,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:19,008 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:19,008 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1721129883, now seen corresponding path program 22 times [2019-09-08 01:16:19,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:19,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:19,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:19,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:19,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:19,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:19,389 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:19,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:19,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:19,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:19,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 01:16:19,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:19,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:19,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-08 01:16:19,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 01:16:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 01:16:19,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:16:19,655 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 27 states. [2019-09-08 01:16:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:19,744 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-09-08 01:16:19,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 01:16:19,744 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 108 [2019-09-08 01:16:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:19,746 INFO L225 Difference]: With dead ends: 124 [2019-09-08 01:16:19,746 INFO L226 Difference]: Without dead ends: 117 [2019-09-08 01:16:19,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:16:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-08 01:16:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-09-08 01:16:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 01:16:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-08 01:16:19,751 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 108 [2019-09-08 01:16:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:19,751 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-08 01:16:19,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 01:16:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-08 01:16:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 01:16:19,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:19,752 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:19,753 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:19,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:19,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1598194580, now seen corresponding path program 23 times [2019-09-08 01:16:19,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:19,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:19,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:20,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:20,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:20,178 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:20,439 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-08 01:16:20,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:20,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 01:16:20,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:20,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:20,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-08 01:16:20,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 01:16:20,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 01:16:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:16:20,480 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 28 states. [2019-09-08 01:16:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:20,571 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-09-08 01:16:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 01:16:20,571 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 112 [2019-09-08 01:16:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:20,572 INFO L225 Difference]: With dead ends: 128 [2019-09-08 01:16:20,572 INFO L226 Difference]: Without dead ends: 121 [2019-09-08 01:16:20,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:16:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-08 01:16:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2019-09-08 01:16:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 01:16:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-09-08 01:16:20,577 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 112 [2019-09-08 01:16:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:20,578 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-09-08 01:16:20,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 01:16:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-09-08 01:16:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 01:16:20,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:20,579 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:20,579 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1429735181, now seen corresponding path program 24 times [2019-09-08 01:16:20,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:20,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:20,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:21,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:21,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:21,037 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:21,246 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-09-08 01:16:21,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:21,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 01:16:21,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:21,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:21,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-08 01:16:21,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 01:16:21,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 01:16:21,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:16:21,287 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 29 states. [2019-09-08 01:16:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:21,390 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-09-08 01:16:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 01:16:21,391 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 116 [2019-09-08 01:16:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:21,392 INFO L225 Difference]: With dead ends: 132 [2019-09-08 01:16:21,392 INFO L226 Difference]: Without dead ends: 125 [2019-09-08 01:16:21,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:16:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-08 01:16:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-09-08 01:16:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-08 01:16:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-09-08 01:16:21,398 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 116 [2019-09-08 01:16:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:21,398 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-09-08 01:16:21,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 01:16:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-09-08 01:16:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 01:16:21,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:21,400 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:21,400 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2057492986, now seen corresponding path program 25 times [2019-09-08 01:16:21,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:21,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:21,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:21,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:21,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:21,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:21,805 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-08 01:16:21,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:21,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 01:16:21,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:22,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:22,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-08 01:16:22,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 01:16:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 01:16:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:16:22,016 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 30 states. [2019-09-08 01:16:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:22,127 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2019-09-08 01:16:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 01:16:22,128 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 120 [2019-09-08 01:16:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:22,129 INFO L225 Difference]: With dead ends: 136 [2019-09-08 01:16:22,129 INFO L226 Difference]: Without dead ends: 129 [2019-09-08 01:16:22,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:16:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-08 01:16:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-09-08 01:16:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-08 01:16:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-09-08 01:16:22,138 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 120 [2019-09-08 01:16:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:22,139 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-09-08 01:16:22,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 01:16:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-09-08 01:16:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 01:16:22,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:22,140 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:22,140 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:22,141 INFO L82 PathProgramCache]: Analyzing trace with hash 814210945, now seen corresponding path program 26 times [2019-09-08 01:16:22,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:22,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:22,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:22,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:22,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:22,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:22,618 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-08 01:16:22,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:22,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:22,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:22,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 01:16:22,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:22,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:22,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-08 01:16:22,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 01:16:22,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 01:16:22,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:16:22,816 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 31 states. [2019-09-08 01:16:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:22,940 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2019-09-08 01:16:22,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 01:16:22,941 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 124 [2019-09-08 01:16:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:22,942 INFO L225 Difference]: With dead ends: 140 [2019-09-08 01:16:22,942 INFO L226 Difference]: Without dead ends: 133 [2019-09-08 01:16:22,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:16:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-08 01:16:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2019-09-08 01:16:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-08 01:16:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-09-08 01:16:22,950 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 124 [2019-09-08 01:16:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:22,950 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-09-08 01:16:22,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 01:16:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-09-08 01:16:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 01:16:22,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:22,952 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:22,952 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1177499256, now seen corresponding path program 27 times [2019-09-08 01:16:22,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:22,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:22,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:22,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:22,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:23,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:23,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:16:23,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:23,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-08 01:16:23,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:23,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 01:16:23,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:23,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:23,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-08 01:16:23,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 01:16:23,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 01:16:23,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:16:23,882 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 32 states. [2019-09-08 01:16:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:24,005 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-09-08 01:16:24,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 01:16:24,006 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 128 [2019-09-08 01:16:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:24,008 INFO L225 Difference]: With dead ends: 144 [2019-09-08 01:16:24,009 INFO L226 Difference]: Without dead ends: 137 [2019-09-08 01:16:24,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:16:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-08 01:16:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-09-08 01:16:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-08 01:16:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-09-08 01:16:24,021 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 128 [2019-09-08 01:16:24,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:24,021 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-09-08 01:16:24,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 01:16:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-09-08 01:16:24,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 01:16:24,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:24,023 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:24,023 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:24,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1089951759, now seen corresponding path program 28 times [2019-09-08 01:16:24,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:24,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:24,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:24,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:24,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:24,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:24,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:24,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:24,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:24,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:24,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 01:16:24,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:24,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:24,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-08 01:16:24,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 01:16:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 01:16:24,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:16:24,706 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 33 states. [2019-09-08 01:16:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:24,798 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-09-08 01:16:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 01:16:24,798 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 132 [2019-09-08 01:16:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:24,800 INFO L225 Difference]: With dead ends: 148 [2019-09-08 01:16:24,800 INFO L226 Difference]: Without dead ends: 141 [2019-09-08 01:16:24,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:16:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-08 01:16:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2019-09-08 01:16:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-08 01:16:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-09-08 01:16:24,808 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 132 [2019-09-08 01:16:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:24,809 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-09-08 01:16:24,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 01:16:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-09-08 01:16:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 01:16:24,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:24,810 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:24,811 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1651160298, now seen corresponding path program 29 times [2019-09-08 01:16:24,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:24,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:24,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:25,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:25,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:25,355 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:25,563 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-08 01:16:25,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:25,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 01:16:25,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:25,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:25,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-08 01:16:25,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 01:16:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 01:16:25,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:16:25,606 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 34 states. [2019-09-08 01:16:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:25,727 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2019-09-08 01:16:25,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 01:16:25,728 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 136 [2019-09-08 01:16:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:25,729 INFO L225 Difference]: With dead ends: 152 [2019-09-08 01:16:25,729 INFO L226 Difference]: Without dead ends: 145 [2019-09-08 01:16:25,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:16:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-08 01:16:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-09-08 01:16:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-08 01:16:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-09-08 01:16:25,734 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 136 [2019-09-08 01:16:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:25,735 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-09-08 01:16:25,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 01:16:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-09-08 01:16:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 01:16:25,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:25,736 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:25,736 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:25,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1000054115, now seen corresponding path program 30 times [2019-09-08 01:16:25,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:25,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:25,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:25,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:25,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:26,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:26,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:26,452 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:26,674 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-09-08 01:16:26,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:26,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 01:16:26,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:26,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-08 01:16:26,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 01:16:26,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 01:16:26,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:16:26,718 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 35 states. [2019-09-08 01:16:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:26,833 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-09-08 01:16:26,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 01:16:26,834 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 140 [2019-09-08 01:16:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:26,835 INFO L225 Difference]: With dead ends: 156 [2019-09-08 01:16:26,835 INFO L226 Difference]: Without dead ends: 149 [2019-09-08 01:16:26,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:16:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-08 01:16:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-09-08 01:16:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-08 01:16:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-09-08 01:16:26,841 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 140 [2019-09-08 01:16:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:26,842 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-09-08 01:16:26,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 01:16:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-09-08 01:16:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 01:16:26,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:26,843 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:26,843 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash 926834340, now seen corresponding path program 31 times [2019-09-08 01:16:26,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:26,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:26,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:26,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:27,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:27,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:27,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:27,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 01:16:27,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:27,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:27,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-08 01:16:27,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 01:16:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 01:16:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:16:27,683 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 36 states. [2019-09-08 01:16:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:27,796 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2019-09-08 01:16:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 01:16:27,797 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 144 [2019-09-08 01:16:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:27,799 INFO L225 Difference]: With dead ends: 160 [2019-09-08 01:16:27,799 INFO L226 Difference]: Without dead ends: 153 [2019-09-08 01:16:27,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:16:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-08 01:16:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2019-09-08 01:16:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-08 01:16:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-09-08 01:16:27,806 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 144 [2019-09-08 01:16:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:27,807 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-09-08 01:16:27,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 01:16:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-09-08 01:16:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 01:16:27,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:27,809 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:27,809 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1964834603, now seen corresponding path program 32 times [2019-09-08 01:16:27,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:27,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:27,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:27,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:27,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:28,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:28,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:28,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:28,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:28,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:28,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 01:16:28,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:28,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:28,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-08 01:16:28,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 01:16:28,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 01:16:28,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:16:28,739 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 37 states. [2019-09-08 01:16:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:28,897 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2019-09-08 01:16:28,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 01:16:28,897 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2019-09-08 01:16:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:28,899 INFO L225 Difference]: With dead ends: 164 [2019-09-08 01:16:28,899 INFO L226 Difference]: Without dead ends: 157 [2019-09-08 01:16:28,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:16:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-08 01:16:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2019-09-08 01:16:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-08 01:16:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-08 01:16:28,905 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 148 [2019-09-08 01:16:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:28,906 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-08 01:16:28,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 01:16:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-08 01:16:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 01:16:28,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:28,907 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:28,908 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:28,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1780089906, now seen corresponding path program 33 times [2019-09-08 01:16:28,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:28,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:28,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:29,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:29,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:29,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:29,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-08 01:16:29,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:29,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 01:16:29,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:29,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:29,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-08 01:16:29,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 01:16:29,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 01:16:29,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:16:29,818 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 38 states. [2019-09-08 01:16:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:29,962 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2019-09-08 01:16:29,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 01:16:29,963 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 152 [2019-09-08 01:16:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:29,965 INFO L225 Difference]: With dead ends: 168 [2019-09-08 01:16:29,965 INFO L226 Difference]: Without dead ends: 161 [2019-09-08 01:16:29,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:16:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-08 01:16:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2019-09-08 01:16:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-08 01:16:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-09-08 01:16:29,970 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 152 [2019-09-08 01:16:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:29,972 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-09-08 01:16:29,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 01:16:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-09-08 01:16:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 01:16:29,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:29,973 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:29,974 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -546361927, now seen corresponding path program 34 times [2019-09-08 01:16:29,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:29,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:29,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:31,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:31,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:31,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:31,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:31,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:31,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1353 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 01:16:31,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:31,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:31,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-08 01:16:31,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 01:16:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 01:16:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:16:31,250 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 39 states. [2019-09-08 01:16:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:31,358 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-09-08 01:16:31,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 01:16:31,359 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 156 [2019-09-08 01:16:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:31,361 INFO L225 Difference]: With dead ends: 172 [2019-09-08 01:16:31,361 INFO L226 Difference]: Without dead ends: 165 [2019-09-08 01:16:31,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:16:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-08 01:16:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-09-08 01:16:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-08 01:16:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-08 01:16:31,367 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 156 [2019-09-08 01:16:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:31,368 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-08 01:16:31,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 01:16:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-08 01:16:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 01:16:31,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:31,369 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:31,369 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash -344572992, now seen corresponding path program 35 times [2019-09-08 01:16:31,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:31,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:31,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:32,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:32,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:32,023 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:32,366 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-08 01:16:32,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:32,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 01:16:32,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:32,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:32,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-08 01:16:32,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 01:16:32,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 01:16:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:16:32,415 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 40 states. [2019-09-08 01:16:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:32,537 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2019-09-08 01:16:32,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 01:16:32,537 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 160 [2019-09-08 01:16:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:32,538 INFO L225 Difference]: With dead ends: 176 [2019-09-08 01:16:32,539 INFO L226 Difference]: Without dead ends: 169 [2019-09-08 01:16:32,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:16:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-08 01:16:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-09-08 01:16:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-08 01:16:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-09-08 01:16:32,545 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 160 [2019-09-08 01:16:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:32,546 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-09-08 01:16:32,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 01:16:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-09-08 01:16:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 01:16:32,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:32,547 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:32,547 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:32,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1638460999, now seen corresponding path program 36 times [2019-09-08 01:16:32,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:32,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:32,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:32,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:32,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:33,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:33,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:33,261 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:33,515 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-09-08 01:16:33,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:33,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 01:16:33,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:33,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:33,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-08 01:16:33,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 01:16:33,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 01:16:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:16:33,566 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 41 states. [2019-09-08 01:16:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:33,720 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2019-09-08 01:16:33,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 01:16:33,721 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 164 [2019-09-08 01:16:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:33,722 INFO L225 Difference]: With dead ends: 180 [2019-09-08 01:16:33,723 INFO L226 Difference]: Without dead ends: 173 [2019-09-08 01:16:33,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:16:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-08 01:16:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2019-09-08 01:16:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-08 01:16:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-08 01:16:33,731 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 164 [2019-09-08 01:16:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:33,732 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-08 01:16:33,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 01:16:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-08 01:16:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 01:16:33,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:33,734 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:33,734 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:33,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1117848910, now seen corresponding path program 37 times [2019-09-08 01:16:33,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:33,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:33,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:33,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:33,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:34,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:34,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:34,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:34,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 01:16:34,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:34,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:34,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-08 01:16:34,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 01:16:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 01:16:34,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:16:34,923 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 42 states. [2019-09-08 01:16:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:35,084 INFO L93 Difference]: Finished difference Result 184 states and 186 transitions. [2019-09-08 01:16:35,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 01:16:35,085 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-09-08 01:16:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:35,086 INFO L225 Difference]: With dead ends: 184 [2019-09-08 01:16:35,086 INFO L226 Difference]: Without dead ends: 177 [2019-09-08 01:16:35,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:16:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-08 01:16:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2019-09-08 01:16:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-08 01:16:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-09-08 01:16:35,093 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 168 [2019-09-08 01:16:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:35,094 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2019-09-08 01:16:35,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 01:16:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2019-09-08 01:16:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 01:16:35,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:35,096 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:35,097 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash 739786965, now seen corresponding path program 38 times [2019-09-08 01:16:35,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:35,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:35,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:35,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:36,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:36,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:16:36,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:36,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:36,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:36,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 01:16:36,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:36,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:36,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-08 01:16:36,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 01:16:36,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 01:16:36,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:16:36,294 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 43 states. [2019-09-08 01:16:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:36,429 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2019-09-08 01:16:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 01:16:36,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 172 [2019-09-08 01:16:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:36,432 INFO L225 Difference]: With dead ends: 188 [2019-09-08 01:16:36,432 INFO L226 Difference]: Without dead ends: 181 [2019-09-08 01:16:36,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:16:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-08 01:16:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2019-09-08 01:16:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-08 01:16:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-08 01:16:36,449 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 172 [2019-09-08 01:16:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:36,449 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-08 01:16:36,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 01:16:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-08 01:16:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 01:16:36,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:36,451 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:36,451 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash -924294948, now seen corresponding path program 39 times [2019-09-08 01:16:36,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:36,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:36,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:36,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:37,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:37,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:37,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:37,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-08 01:16:37,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:37,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1523 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 01:16:37,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:37,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:37,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-08 01:16:37,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 01:16:37,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 01:16:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:16:37,600 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 44 states. [2019-09-08 01:16:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:37,740 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2019-09-08 01:16:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 01:16:37,741 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 176 [2019-09-08 01:16:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:37,743 INFO L225 Difference]: With dead ends: 192 [2019-09-08 01:16:37,743 INFO L226 Difference]: Without dead ends: 185 [2019-09-08 01:16:37,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:16:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-08 01:16:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-09-08 01:16:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-08 01:16:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-09-08 01:16:37,756 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 176 [2019-09-08 01:16:37,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:37,756 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-09-08 01:16:37,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 01:16:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-09-08 01:16:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 01:16:37,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:37,760 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:37,761 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:37,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1091249507, now seen corresponding path program 40 times [2019-09-08 01:16:37,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:37,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:37,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:37,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:37,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:38,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:38,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:38,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:38,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:38,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:38,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1557 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 01:16:38,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:38,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:38,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-08 01:16:38,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 01:16:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 01:16:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:16:38,848 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 45 states. [2019-09-08 01:16:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:38,966 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2019-09-08 01:16:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 01:16:38,967 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 180 [2019-09-08 01:16:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:38,973 INFO L225 Difference]: With dead ends: 196 [2019-09-08 01:16:38,973 INFO L226 Difference]: Without dead ends: 189 [2019-09-08 01:16:38,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:16:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-08 01:16:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-09-08 01:16:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-08 01:16:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-09-08 01:16:38,981 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 180 [2019-09-08 01:16:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:38,981 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-09-08 01:16:38,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 01:16:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-09-08 01:16:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 01:16:38,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:38,983 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:38,983 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:38,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1449505174, now seen corresponding path program 41 times [2019-09-08 01:16:38,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:38,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:38,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:38,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:38,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:39,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:39,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:39,834 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:40,122 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2019-09-08 01:16:40,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:40,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 01:16:40,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:40,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:40,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-08 01:16:40,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 01:16:40,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 01:16:40,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:16:40,179 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 46 states. [2019-09-08 01:16:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:40,320 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2019-09-08 01:16:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 01:16:40,321 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 184 [2019-09-08 01:16:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:40,322 INFO L225 Difference]: With dead ends: 200 [2019-09-08 01:16:40,322 INFO L226 Difference]: Without dead ends: 193 [2019-09-08 01:16:40,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:16:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-08 01:16:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2019-09-08 01:16:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-08 01:16:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-09-08 01:16:40,328 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 184 [2019-09-08 01:16:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:40,329 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-09-08 01:16:40,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 01:16:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-09-08 01:16:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 01:16:40,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:40,330 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:40,331 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1959762929, now seen corresponding path program 42 times [2019-09-08 01:16:40,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:40,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:41,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:41,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:16:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:41,684 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2019-09-08 01:16:41,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:41,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:16:41,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:41,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:41,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-08 01:16:41,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 01:16:41,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 01:16:41,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:16:41,766 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 47 states. [2019-09-08 01:16:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:41,945 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2019-09-08 01:16:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 01:16:41,946 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 188 [2019-09-08 01:16:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:41,947 INFO L225 Difference]: With dead ends: 204 [2019-09-08 01:16:41,947 INFO L226 Difference]: Without dead ends: 197 [2019-09-08 01:16:41,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:16:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-08 01:16:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-08 01:16:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-08 01:16:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-08 01:16:41,953 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 188 [2019-09-08 01:16:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:41,954 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-08 01:16:41,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 01:16:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-08 01:16:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 01:16:41,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:41,956 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:41,956 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash -503001608, now seen corresponding path program 43 times [2019-09-08 01:16:41,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:41,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:41,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:41,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:41,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:42,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:42,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:42,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:43,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 01:16:43,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:43,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:43,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-08 01:16:43,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 01:16:43,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 01:16:43,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:16:43,150 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 48 states. [2019-09-08 01:16:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:43,313 INFO L93 Difference]: Finished difference Result 208 states and 210 transitions. [2019-09-08 01:16:43,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 01:16:43,315 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 192 [2019-09-08 01:16:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:43,316 INFO L225 Difference]: With dead ends: 208 [2019-09-08 01:16:43,317 INFO L226 Difference]: Without dead ends: 201 [2019-09-08 01:16:43,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:16:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-08 01:16:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2019-09-08 01:16:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-08 01:16:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-09-08 01:16:43,322 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 192 [2019-09-08 01:16:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:43,323 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2019-09-08 01:16:43,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 01:16:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2019-09-08 01:16:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 01:16:43,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:43,325 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:43,325 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:43,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1840489599, now seen corresponding path program 44 times [2019-09-08 01:16:43,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:43,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:43,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:43,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:43,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:44,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:44,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:44,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:44,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:44,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:44,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 01:16:44,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:44,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:44,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-08 01:16:44,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 01:16:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 01:16:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:16:44,642 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 49 states. [2019-09-08 01:16:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:44,849 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2019-09-08 01:16:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 01:16:44,849 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 196 [2019-09-08 01:16:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:44,851 INFO L225 Difference]: With dead ends: 212 [2019-09-08 01:16:44,852 INFO L226 Difference]: Without dead ends: 205 [2019-09-08 01:16:44,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:16:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-08 01:16:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-09-08 01:16:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-08 01:16:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-08 01:16:44,863 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 196 [2019-09-08 01:16:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:44,864 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-08 01:16:44,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 01:16:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-08 01:16:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 01:16:44,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:44,866 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:44,867 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:44,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1098243974, now seen corresponding path program 45 times [2019-09-08 01:16:44,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:44,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:44,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:44,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:44,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:45,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:45,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:45,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:46,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-08 01:16:46,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:46,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 1727 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 01:16:46,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:46,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:46,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-08 01:16:46,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 01:16:46,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 01:16:46,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:16:46,392 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 50 states. [2019-09-08 01:16:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:46,582 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2019-09-08 01:16:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 01:16:46,582 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 200 [2019-09-08 01:16:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:46,584 INFO L225 Difference]: With dead ends: 216 [2019-09-08 01:16:46,584 INFO L226 Difference]: Without dead ends: 209 [2019-09-08 01:16:46,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:16:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-08 01:16:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-09-08 01:16:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-08 01:16:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-09-08 01:16:46,590 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 200 [2019-09-08 01:16:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:46,591 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-09-08 01:16:46,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 01:16:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-09-08 01:16:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 01:16:46,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:46,592 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:46,593 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1543160051, now seen corresponding path program 46 times [2019-09-08 01:16:46,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:46,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:46,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:46,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:47,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:47,586 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-08 01:16:47,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:47,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:47,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:47,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 01:16:47,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:47,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:47,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-08 01:16:47,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 01:16:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 01:16:47,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:16:47,922 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 51 states. [2019-09-08 01:16:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:48,072 INFO L93 Difference]: Finished difference Result 220 states and 222 transitions. [2019-09-08 01:16:48,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 01:16:48,073 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 204 [2019-09-08 01:16:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:48,075 INFO L225 Difference]: With dead ends: 220 [2019-09-08 01:16:48,075 INFO L226 Difference]: Without dead ends: 213 [2019-09-08 01:16:48,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:16:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-08 01:16:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2019-09-08 01:16:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-08 01:16:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-08 01:16:48,082 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 204 [2019-09-08 01:16:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:48,082 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-08 01:16:48,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 01:16:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-08 01:16:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 01:16:48,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:48,084 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:48,084 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1765507860, now seen corresponding path program 47 times [2019-09-08 01:16:48,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:48,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:48,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:48,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:49,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:49,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:49,095 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:16:49,440 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-09-08 01:16:49,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:49,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 01:16:49,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:16:49,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:49,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-08 01:16:49,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 01:16:49,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 01:16:49,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:16:49,506 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 52 states. [2019-09-08 01:16:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:49,685 INFO L93 Difference]: Finished difference Result 224 states and 226 transitions. [2019-09-08 01:16:49,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 01:16:49,686 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 208 [2019-09-08 01:16:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:49,689 INFO L225 Difference]: With dead ends: 224 [2019-09-08 01:16:49,689 INFO L226 Difference]: Without dead ends: 217 [2019-09-08 01:16:49,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:16:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-08 01:16:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-09-08 01:16:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-08 01:16:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2019-09-08 01:16:49,697 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 208 [2019-09-08 01:16:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:49,697 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2019-09-08 01:16:49,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 01:16:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2019-09-08 01:16:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 01:16:49,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:49,700 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:49,701 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1645374363, now seen corresponding path program 48 times [2019-09-08 01:16:49,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:49,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:49,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:49,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:50,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:50,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:16:50,795 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:16:51,154 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2019-09-08 01:16:51,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:51,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 01:16:51,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:51,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:51,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-08 01:16:51,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 01:16:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 01:16:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:16:51,210 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 53 states. [2019-09-08 01:16:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:51,414 INFO L93 Difference]: Finished difference Result 228 states and 230 transitions. [2019-09-08 01:16:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 01:16:51,415 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 212 [2019-09-08 01:16:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:51,416 INFO L225 Difference]: With dead ends: 228 [2019-09-08 01:16:51,416 INFO L226 Difference]: Without dead ends: 221 [2019-09-08 01:16:51,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:16:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-08 01:16:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2019-09-08 01:16:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-08 01:16:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 219 transitions. [2019-09-08 01:16:51,425 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 219 transitions. Word has length 212 [2019-09-08 01:16:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:51,426 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 219 transitions. [2019-09-08 01:16:51,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 01:16:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2019-09-08 01:16:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 01:16:51,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:51,428 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:51,428 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash -861685598, now seen corresponding path program 49 times [2019-09-08 01:16:51,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:51,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:51,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:51,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:51,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:52,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:52,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:16:52,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:52,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 1863 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 01:16:52,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:52,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:52,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-08 01:16:52,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 01:16:52,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 01:16:52,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:16:52,900 INFO L87 Difference]: Start difference. First operand 218 states and 219 transitions. Second operand 54 states. [2019-09-08 01:16:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:53,072 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2019-09-08 01:16:53,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 01:16:53,073 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 216 [2019-09-08 01:16:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:53,075 INFO L225 Difference]: With dead ends: 232 [2019-09-08 01:16:53,075 INFO L226 Difference]: Without dead ends: 225 [2019-09-08 01:16:53,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:16:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-08 01:16:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-09-08 01:16:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-08 01:16:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2019-09-08 01:16:53,083 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 216 [2019-09-08 01:16:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:53,083 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2019-09-08 01:16:53,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 01:16:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2019-09-08 01:16:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 01:16:53,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:53,085 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:53,085 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:53,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1003935191, now seen corresponding path program 50 times [2019-09-08 01:16:53,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:53,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:53,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:16:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:54,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:54,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:54,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:16:54,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:16:54,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:54,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 01:16:54,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:54,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:54,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-08 01:16:54,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 01:16:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 01:16:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:16:54,547 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 55 states. [2019-09-08 01:16:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:54,782 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2019-09-08 01:16:54,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 01:16:54,783 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 220 [2019-09-08 01:16:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:54,784 INFO L225 Difference]: With dead ends: 236 [2019-09-08 01:16:54,784 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 01:16:54,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:16:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 01:16:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-09-08 01:16:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-08 01:16:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2019-09-08 01:16:54,790 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 220 [2019-09-08 01:16:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:54,791 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2019-09-08 01:16:54,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 01:16:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2019-09-08 01:16:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 01:16:54,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:54,793 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:54,793 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1325629392, now seen corresponding path program 51 times [2019-09-08 01:16:54,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:54,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:54,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:54,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:54,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:55,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:55,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:55,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:16:56,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-09-08 01:16:56,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:56,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1931 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 01:16:56,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:56,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:56,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-08 01:16:56,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 01:16:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 01:16:56,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:16:56,446 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 56 states. [2019-09-08 01:16:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:56,678 INFO L93 Difference]: Finished difference Result 240 states and 242 transitions. [2019-09-08 01:16:56,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 01:16:56,678 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 224 [2019-09-08 01:16:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:56,679 INFO L225 Difference]: With dead ends: 240 [2019-09-08 01:16:56,679 INFO L226 Difference]: Without dead ends: 233 [2019-09-08 01:16:56,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:16:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-08 01:16:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2019-09-08 01:16:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-08 01:16:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2019-09-08 01:16:56,685 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 224 [2019-09-08 01:16:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:56,685 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2019-09-08 01:16:56,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 01:16:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2019-09-08 01:16:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 01:16:56,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:56,687 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:56,688 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1198032201, now seen corresponding path program 52 times [2019-09-08 01:16:56,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:56,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:56,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:57,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:57,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:57,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:16:58,193 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:16:58,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:16:58,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 1965 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 01:16:58,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:16:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:58,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:16:58,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-08 01:16:58,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 01:16:58,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 01:16:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:16:58,258 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 57 states. [2019-09-08 01:16:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:16:58,471 INFO L93 Difference]: Finished difference Result 244 states and 246 transitions. [2019-09-08 01:16:58,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 01:16:58,472 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 228 [2019-09-08 01:16:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:16:58,474 INFO L225 Difference]: With dead ends: 244 [2019-09-08 01:16:58,474 INFO L226 Difference]: Without dead ends: 237 [2019-09-08 01:16:58,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:16:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-08 01:16:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2019-09-08 01:16:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-08 01:16:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2019-09-08 01:16:58,479 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 228 [2019-09-08 01:16:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:16:58,480 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2019-09-08 01:16:58,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 01:16:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2019-09-08 01:16:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 01:16:58,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:16:58,482 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:16:58,482 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:16:58,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:16:58,482 INFO L82 PathProgramCache]: Analyzing trace with hash 764664254, now seen corresponding path program 53 times [2019-09-08 01:16:58,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:16:58,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:16:58,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:58,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:16:58,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:16:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:16:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:16:59,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:16:59,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:16:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:17:00,216 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2019-09-08 01:17:00,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:00,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1999 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 01:17:00,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:00,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:00,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-08 01:17:00,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 01:17:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 01:17:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:17:00,303 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 58 states. [2019-09-08 01:17:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:00,542 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2019-09-08 01:17:00,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 01:17:00,542 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 232 [2019-09-08 01:17:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:00,544 INFO L225 Difference]: With dead ends: 248 [2019-09-08 01:17:00,544 INFO L226 Difference]: Without dead ends: 241 [2019-09-08 01:17:00,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:17:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-08 01:17:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-09-08 01:17:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-08 01:17:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2019-09-08 01:17:00,550 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 232 [2019-09-08 01:17:00,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:00,551 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2019-09-08 01:17:00,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 01:17:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2019-09-08 01:17:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 01:17:00,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:00,553 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:00,553 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:00,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:00,553 INFO L82 PathProgramCache]: Analyzing trace with hash -5546683, now seen corresponding path program 54 times [2019-09-08 01:17:00,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:00,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:00,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:00,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:00,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:01,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:01,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:01,842 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:17:02,266 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 57 check-sat command(s) [2019-09-08 01:17:02,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:02,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 2033 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 01:17:02,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:02,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:02,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-08 01:17:02,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 01:17:02,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 01:17:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:17:02,346 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 59 states. [2019-09-08 01:17:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:02,561 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2019-09-08 01:17:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 01:17:02,565 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 236 [2019-09-08 01:17:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:02,567 INFO L225 Difference]: With dead ends: 252 [2019-09-08 01:17:02,568 INFO L226 Difference]: Without dead ends: 245 [2019-09-08 01:17:02,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:17:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-08 01:17:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-09-08 01:17:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-08 01:17:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2019-09-08 01:17:02,574 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 236 [2019-09-08 01:17:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:02,574 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 243 transitions. [2019-09-08 01:17:02,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 01:17:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 243 transitions. [2019-09-08 01:17:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 01:17:02,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:02,576 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:02,577 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash 733463884, now seen corresponding path program 55 times [2019-09-08 01:17:02,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:02,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:02,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:02,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:02,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:03,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:03,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:04,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:04,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 2067 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 01:17:04,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:04,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:04,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-08 01:17:04,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 01:17:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 01:17:04,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:17:04,357 INFO L87 Difference]: Start difference. First operand 242 states and 243 transitions. Second operand 60 states. [2019-09-08 01:17:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:04,600 INFO L93 Difference]: Finished difference Result 256 states and 258 transitions. [2019-09-08 01:17:04,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 01:17:04,600 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 240 [2019-09-08 01:17:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:04,602 INFO L225 Difference]: With dead ends: 256 [2019-09-08 01:17:04,602 INFO L226 Difference]: Without dead ends: 249 [2019-09-08 01:17:04,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:17:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-08 01:17:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-09-08 01:17:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-08 01:17:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2019-09-08 01:17:04,608 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 240 [2019-09-08 01:17:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:04,609 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 247 transitions. [2019-09-08 01:17:04,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 01:17:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 247 transitions. [2019-09-08 01:17:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 01:17:04,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:04,611 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:04,611 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:04,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash 733139411, now seen corresponding path program 56 times [2019-09-08 01:17:04,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:04,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:04,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:04,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:04,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:06,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:06,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:06,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:06,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:06,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 2101 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:17:06,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:06,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:06,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-08 01:17:06,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 01:17:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 01:17:06,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:17:06,378 INFO L87 Difference]: Start difference. First operand 246 states and 247 transitions. Second operand 61 states. [2019-09-08 01:17:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:06,629 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2019-09-08 01:17:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 01:17:06,629 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 244 [2019-09-08 01:17:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:06,631 INFO L225 Difference]: With dead ends: 260 [2019-09-08 01:17:06,631 INFO L226 Difference]: Without dead ends: 253 [2019-09-08 01:17:06,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:17:06,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-08 01:17:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2019-09-08 01:17:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-08 01:17:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2019-09-08 01:17:06,637 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 244 [2019-09-08 01:17:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:06,638 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2019-09-08 01:17:06,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 01:17:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2019-09-08 01:17:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 01:17:06,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:06,639 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:06,640 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1723220698, now seen corresponding path program 57 times [2019-09-08 01:17:06,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:06,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:06,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:08,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:08,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:08,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:17:08,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-09-08 01:17:08,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:08,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 2135 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 01:17:08,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:08,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:08,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-08 01:17:08,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 01:17:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 01:17:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:17:08,653 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 62 states. [2019-09-08 01:17:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:08,878 INFO L93 Difference]: Finished difference Result 264 states and 266 transitions. [2019-09-08 01:17:08,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 01:17:08,878 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 248 [2019-09-08 01:17:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:08,879 INFO L225 Difference]: With dead ends: 264 [2019-09-08 01:17:08,879 INFO L226 Difference]: Without dead ends: 257 [2019-09-08 01:17:08,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:17:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-08 01:17:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2019-09-08 01:17:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-08 01:17:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2019-09-08 01:17:08,885 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 248 [2019-09-08 01:17:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:08,886 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2019-09-08 01:17:08,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 01:17:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2019-09-08 01:17:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 01:17:08,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:08,888 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:08,888 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1594107807, now seen corresponding path program 58 times [2019-09-08 01:17:08,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:08,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:08,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:08,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:10,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:10,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:10,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:17:10,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:17:10,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:10,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 2169 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 01:17:10,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:10,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:10,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-08 01:17:10,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 01:17:10,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 01:17:10,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:17:10,837 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 63 states. [2019-09-08 01:17:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:11,011 INFO L93 Difference]: Finished difference Result 268 states and 270 transitions. [2019-09-08 01:17:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 01:17:11,012 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 252 [2019-09-08 01:17:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:11,014 INFO L225 Difference]: With dead ends: 268 [2019-09-08 01:17:11,014 INFO L226 Difference]: Without dead ends: 261 [2019-09-08 01:17:11,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:17:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-08 01:17:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2019-09-08 01:17:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 01:17:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2019-09-08 01:17:11,020 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 252 [2019-09-08 01:17:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:11,021 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2019-09-08 01:17:11,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 01:17:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2019-09-08 01:17:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 01:17:11,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:11,023 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:11,023 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:11,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:11,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1809666664, now seen corresponding path program 59 times [2019-09-08 01:17:11,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:11,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:11,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:11,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:11,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:12,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:12,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:12,663 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:17:13,121 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2019-09-08 01:17:13,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:13,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 2203 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 01:17:13,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:13,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:13,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-08 01:17:13,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-08 01:17:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-08 01:17:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:17:13,186 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 64 states. [2019-09-08 01:17:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:13,471 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2019-09-08 01:17:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 01:17:13,471 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 256 [2019-09-08 01:17:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:13,472 INFO L225 Difference]: With dead ends: 272 [2019-09-08 01:17:13,472 INFO L226 Difference]: Without dead ends: 265 [2019-09-08 01:17:13,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:17:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-08 01:17:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2019-09-08 01:17:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 01:17:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 263 transitions. [2019-09-08 01:17:13,479 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 263 transitions. Word has length 256 [2019-09-08 01:17:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:13,479 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 263 transitions. [2019-09-08 01:17:13,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-08 01:17:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 263 transitions. [2019-09-08 01:17:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 01:17:13,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:13,481 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:13,481 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1781239569, now seen corresponding path program 60 times [2019-09-08 01:17:13,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:13,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:13,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:13,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:15,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:15,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:15,156 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:17:15,650 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 63 check-sat command(s) [2019-09-08 01:17:15,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:15,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 2237 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 01:17:15,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:15,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:15,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-08 01:17:15,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 01:17:15,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 01:17:15,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:17:15,716 INFO L87 Difference]: Start difference. First operand 262 states and 263 transitions. Second operand 65 states. [2019-09-08 01:17:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:16,003 INFO L93 Difference]: Finished difference Result 276 states and 278 transitions. [2019-09-08 01:17:16,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 01:17:16,004 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 260 [2019-09-08 01:17:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:16,005 INFO L225 Difference]: With dead ends: 276 [2019-09-08 01:17:16,005 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 01:17:16,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:17:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 01:17:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-09-08 01:17:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-08 01:17:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2019-09-08 01:17:16,011 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 260 [2019-09-08 01:17:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:16,012 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2019-09-08 01:17:16,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 01:17:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2019-09-08 01:17:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 01:17:16,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:16,014 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:16,014 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1703218186, now seen corresponding path program 61 times [2019-09-08 01:17:16,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:16,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:17,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:17,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:17,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:18,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 2271 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 01:17:18,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 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-08 01:17:18,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:18,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-08 01:17:18,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 01:17:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 01:17:18,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:17:18,115 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 66 states. [2019-09-08 01:17:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:18,362 INFO L93 Difference]: Finished difference Result 280 states and 282 transitions. [2019-09-08 01:17:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 01:17:18,362 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 264 [2019-09-08 01:17:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:18,364 INFO L225 Difference]: With dead ends: 280 [2019-09-08 01:17:18,364 INFO L226 Difference]: Without dead ends: 273 [2019-09-08 01:17:18,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:17:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-08 01:17:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2019-09-08 01:17:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 01:17:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2019-09-08 01:17:18,370 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 264 [2019-09-08 01:17:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:18,370 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2019-09-08 01:17:18,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 01:17:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2019-09-08 01:17:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 01:17:18,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:18,372 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:18,373 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 311073661, now seen corresponding path program 62 times [2019-09-08 01:17:18,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:18,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:18,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:20,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:20,010 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-08 01:17:20,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:20,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:20,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:20,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 2305 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 01:17:20,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:20,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:20,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-08 01:17:20,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 01:17:20,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 01:17:20,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:17:20,404 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 67 states. [2019-09-08 01:17:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:20,719 INFO L93 Difference]: Finished difference Result 284 states and 286 transitions. [2019-09-08 01:17:20,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 01:17:20,719 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 268 [2019-09-08 01:17:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:20,721 INFO L225 Difference]: With dead ends: 284 [2019-09-08 01:17:20,721 INFO L226 Difference]: Without dead ends: 277 [2019-09-08 01:17:20,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:17:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-08 01:17:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2019-09-08 01:17:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-08 01:17:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2019-09-08 01:17:20,727 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 268 [2019-09-08 01:17:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:20,727 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2019-09-08 01:17:20,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 01:17:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2019-09-08 01:17:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 01:17:20,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:20,730 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:20,730 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 601696132, now seen corresponding path program 63 times [2019-09-08 01:17:20,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:20,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:20,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:22,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:22,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:22,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:17:22,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-08 01:17:22,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:22,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 2339 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 01:17:22,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:23,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:23,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-08 01:17:23,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-08 01:17:23,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-08 01:17:23,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:17:23,055 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 68 states. [2019-09-08 01:17:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:23,358 INFO L93 Difference]: Finished difference Result 288 states and 290 transitions. [2019-09-08 01:17:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 01:17:23,358 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 272 [2019-09-08 01:17:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:23,359 INFO L225 Difference]: With dead ends: 288 [2019-09-08 01:17:23,359 INFO L226 Difference]: Without dead ends: 281 [2019-09-08 01:17:23,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:17:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-08 01:17:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2019-09-08 01:17:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-08 01:17:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 279 transitions. [2019-09-08 01:17:23,365 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 279 transitions. Word has length 272 [2019-09-08 01:17:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:23,366 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 279 transitions. [2019-09-08 01:17:23,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-08 01:17:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 279 transitions. [2019-09-08 01:17:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 01:17:23,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:23,368 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:23,368 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash -244557813, now seen corresponding path program 64 times [2019-09-08 01:17:23,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:23,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:23,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:23,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:23,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:25,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:25,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:25,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:17:25,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:17:25,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:25,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 2373 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 01:17:25,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:25,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:25,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-08 01:17:25,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-08 01:17:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-08 01:17:25,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:17:25,564 INFO L87 Difference]: Start difference. First operand 278 states and 279 transitions. Second operand 69 states. [2019-09-08 01:17:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:25,838 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2019-09-08 01:17:25,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 01:17:25,839 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 276 [2019-09-08 01:17:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:25,840 INFO L225 Difference]: With dead ends: 292 [2019-09-08 01:17:25,840 INFO L226 Difference]: Without dead ends: 285 [2019-09-08 01:17:25,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:17:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-08 01:17:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-09-08 01:17:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-08 01:17:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 283 transitions. [2019-09-08 01:17:25,846 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 283 transitions. Word has length 276 [2019-09-08 01:17:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:25,846 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 283 transitions. [2019-09-08 01:17:25,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-08 01:17:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 283 transitions. [2019-09-08 01:17:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 01:17:25,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:25,848 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:25,849 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:25,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash 189918482, now seen corresponding path program 65 times [2019-09-08 01:17:25,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:25,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:25,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:25,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:25,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:27,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:27,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:27,689 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:17:28,223 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 68 check-sat command(s) [2019-09-08 01:17:28,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:28,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 2407 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 01:17:28,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (68)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:17:28,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:28,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-08 01:17:28,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 01:17:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 01:17:28,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:17:28,331 INFO L87 Difference]: Start difference. First operand 282 states and 283 transitions. Second operand 70 states. [2019-09-08 01:17:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:28,614 INFO L93 Difference]: Finished difference Result 296 states and 298 transitions. [2019-09-08 01:17:28,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 01:17:28,615 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 280 [2019-09-08 01:17:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:28,617 INFO L225 Difference]: With dead ends: 296 [2019-09-08 01:17:28,617 INFO L226 Difference]: Without dead ends: 289 [2019-09-08 01:17:28,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:17:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-08 01:17:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-09-08 01:17:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-08 01:17:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 287 transitions. [2019-09-08 01:17:28,624 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 287 transitions. Word has length 280 [2019-09-08 01:17:28,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:28,624 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 287 transitions. [2019-09-08 01:17:28,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 01:17:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 287 transitions. [2019-09-08 01:17:28,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 01:17:28,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:28,626 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:28,626 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:28,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:28,627 INFO L82 PathProgramCache]: Analyzing trace with hash -557341031, now seen corresponding path program 66 times [2019-09-08 01:17:28,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:28,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:28,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:30,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:30,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:30,619 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:17:31,178 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 69 check-sat command(s) [2019-09-08 01:17:31,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:31,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 01:17:31,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:31,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:31,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-08 01:17:31,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-08 01:17:31,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-08 01:17:31,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:17:31,251 INFO L87 Difference]: Start difference. First operand 286 states and 287 transitions. Second operand 71 states. [2019-09-08 01:17:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:31,575 INFO L93 Difference]: Finished difference Result 300 states and 302 transitions. [2019-09-08 01:17:31,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 01:17:31,575 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 284 [2019-09-08 01:17:31,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:31,576 INFO L225 Difference]: With dead ends: 300 [2019-09-08 01:17:31,577 INFO L226 Difference]: Without dead ends: 293 [2019-09-08 01:17:31,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:17:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-08 01:17:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-09-08 01:17:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-08 01:17:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2019-09-08 01:17:31,581 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 284 [2019-09-08 01:17:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:31,582 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2019-09-08 01:17:31,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-08 01:17:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2019-09-08 01:17:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 01:17:31,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:31,584 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:31,584 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:31,584 INFO L82 PathProgramCache]: Analyzing trace with hash 640107680, now seen corresponding path program 67 times [2019-09-08 01:17:31,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:31,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:31,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:31,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:31,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:33,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:33,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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:33,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:33,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 01:17:33,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:33,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:33,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-08 01:17:33,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-08 01:17:33,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-08 01:17:33,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:17:33,940 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand 72 states. [2019-09-08 01:17:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:34,184 INFO L93 Difference]: Finished difference Result 304 states and 306 transitions. [2019-09-08 01:17:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 01:17:34,184 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 288 [2019-09-08 01:17:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:34,186 INFO L225 Difference]: With dead ends: 304 [2019-09-08 01:17:34,186 INFO L226 Difference]: Without dead ends: 297 [2019-09-08 01:17:34,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:17:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-08 01:17:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-09-08 01:17:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-08 01:17:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2019-09-08 01:17:34,193 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 288 [2019-09-08 01:17:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:34,193 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2019-09-08 01:17:34,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-08 01:17:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2019-09-08 01:17:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 01:17:34,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:34,195 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:34,195 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1491765031, now seen corresponding path program 68 times [2019-09-08 01:17:34,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:34,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:34,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:36,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:36,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:36,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:36,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:36,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:36,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 2509 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 01:17:36,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:36,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:36,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-08 01:17:36,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 01:17:36,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 01:17:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:17:36,600 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 73 states. [2019-09-08 01:17:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:36,811 INFO L93 Difference]: Finished difference Result 308 states and 310 transitions. [2019-09-08 01:17:36,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 01:17:36,811 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 292 [2019-09-08 01:17:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:36,812 INFO L225 Difference]: With dead ends: 308 [2019-09-08 01:17:36,812 INFO L226 Difference]: Without dead ends: 301 [2019-09-08 01:17:36,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:17:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-08 01:17:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2019-09-08 01:17:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-08 01:17:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2019-09-08 01:17:36,817 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 292 [2019-09-08 01:17:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:36,817 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2019-09-08 01:17:36,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 01:17:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2019-09-08 01:17:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 01:17:36,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:36,819 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:36,820 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:36,820 INFO L82 PathProgramCache]: Analyzing trace with hash 464203310, now seen corresponding path program 69 times [2019-09-08 01:17:36,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:36,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:36,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:36,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:36,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:38,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:38,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:38,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:17:39,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-09-08 01:17:39,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 2543 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-08 01:17:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:39,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:39,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-08 01:17:39,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-08 01:17:39,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-08 01:17:39,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:17:39,567 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 74 states. [2019-09-08 01:17:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:40,066 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2019-09-08 01:17:40,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 01:17:40,067 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 296 [2019-09-08 01:17:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:40,069 INFO L225 Difference]: With dead ends: 312 [2019-09-08 01:17:40,069 INFO L226 Difference]: Without dead ends: 305 [2019-09-08 01:17:40,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:17:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-08 01:17:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2019-09-08 01:17:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-08 01:17:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2019-09-08 01:17:40,077 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 296 [2019-09-08 01:17:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:40,079 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2019-09-08 01:17:40,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-08 01:17:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2019-09-08 01:17:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 01:17:40,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:40,081 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:40,081 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1339885131, now seen corresponding path program 70 times [2019-09-08 01:17:40,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:40,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:42,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:42,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:42,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:17:42,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:17:42,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:42,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 2577 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 01:17:42,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:42,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:42,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-08 01:17:42,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-08 01:17:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-08 01:17:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:17:42,642 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 75 states. [2019-09-08 01:17:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:42,958 INFO L93 Difference]: Finished difference Result 316 states and 318 transitions. [2019-09-08 01:17:42,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 01:17:42,958 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 300 [2019-09-08 01:17:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:42,960 INFO L225 Difference]: With dead ends: 316 [2019-09-08 01:17:42,960 INFO L226 Difference]: Without dead ends: 309 [2019-09-08 01:17:42,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:17:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-08 01:17:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-09-08 01:17:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-08 01:17:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 307 transitions. [2019-09-08 01:17:42,964 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 307 transitions. Word has length 300 [2019-09-08 01:17:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:42,965 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 307 transitions. [2019-09-08 01:17:42,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-08 01:17:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 307 transitions. [2019-09-08 01:17:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 01:17:42,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:42,966 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:42,966 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:42,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:42,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1697360316, now seen corresponding path program 71 times [2019-09-08 01:17:42,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:42,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:42,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:42,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:44,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:44,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:17:45,653 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) [2019-09-08 01:17:45,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:45,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 01:17:45,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:45,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:45,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-08 01:17:45,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 01:17:45,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 01:17:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:17:45,777 INFO L87 Difference]: Start difference. First operand 306 states and 307 transitions. Second operand 76 states. [2019-09-08 01:17:45,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:45,998 INFO L93 Difference]: Finished difference Result 320 states and 322 transitions. [2019-09-08 01:17:45,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 01:17:45,998 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 304 [2019-09-08 01:17:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:46,000 INFO L225 Difference]: With dead ends: 320 [2019-09-08 01:17:46,000 INFO L226 Difference]: Without dead ends: 313 [2019-09-08 01:17:46,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:17:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-08 01:17:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2019-09-08 01:17:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 01:17:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 311 transitions. [2019-09-08 01:17:46,005 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 311 transitions. Word has length 304 [2019-09-08 01:17:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:46,005 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 311 transitions. [2019-09-08 01:17:46,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 01:17:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 311 transitions. [2019-09-08 01:17:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 01:17:46,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:46,006 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:46,006 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 113180227, now seen corresponding path program 72 times [2019-09-08 01:17:46,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:46,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:46,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:46,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:46,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:48,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:48,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:48,216 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:17:48,895 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2019-09-08 01:17:48,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:48,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 2645 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 01:17:48,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:49,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-08 01:17:49,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-08 01:17:49,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-08 01:17:49,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:17:49,053 INFO L87 Difference]: Start difference. First operand 310 states and 311 transitions. Second operand 77 states. [2019-09-08 01:17:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:49,399 INFO L93 Difference]: Finished difference Result 324 states and 326 transitions. [2019-09-08 01:17:49,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 01:17:49,400 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 308 [2019-09-08 01:17:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:49,401 INFO L225 Difference]: With dead ends: 324 [2019-09-08 01:17:49,401 INFO L226 Difference]: Without dead ends: 317 [2019-09-08 01:17:49,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:17:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-08 01:17:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2019-09-08 01:17:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-08 01:17:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 315 transitions. [2019-09-08 01:17:49,406 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 315 transitions. Word has length 308 [2019-09-08 01:17:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:49,407 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 315 transitions. [2019-09-08 01:17:49,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-08 01:17:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 315 transitions. [2019-09-08 01:17:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 01:17:49,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:49,409 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:49,409 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:49,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1308014410, now seen corresponding path program 73 times [2019-09-08 01:17:49,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:49,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:49,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:49,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:51,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:51,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:51,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-08 01:17:51,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:52,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:52,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-08 01:17:52,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-08 01:17:52,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-08 01:17:52,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:17:52,060 INFO L87 Difference]: Start difference. First operand 314 states and 315 transitions. Second operand 78 states. [2019-09-08 01:17:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:52,438 INFO L93 Difference]: Finished difference Result 328 states and 330 transitions. [2019-09-08 01:17:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 01:17:52,438 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 312 [2019-09-08 01:17:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:52,439 INFO L225 Difference]: With dead ends: 328 [2019-09-08 01:17:52,439 INFO L226 Difference]: Without dead ends: 321 [2019-09-08 01:17:52,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:17:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-08 01:17:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2019-09-08 01:17:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-08 01:17:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 319 transitions. [2019-09-08 01:17:52,444 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 319 transitions. Word has length 312 [2019-09-08 01:17:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:52,445 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 319 transitions. [2019-09-08 01:17:52,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-08 01:17:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 319 transitions. [2019-09-08 01:17:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 01:17:52,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:52,447 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:52,447 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1359779025, now seen corresponding path program 74 times [2019-09-08 01:17:52,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:52,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:52,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:17:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:54,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:54,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:54,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:17:55,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:17:55,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:55,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-08 01:17:55,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:55,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:55,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-08 01:17:55,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-08 01:17:55,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-08 01:17:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:17:55,146 INFO L87 Difference]: Start difference. First operand 318 states and 319 transitions. Second operand 79 states. [2019-09-08 01:17:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:55,376 INFO L93 Difference]: Finished difference Result 332 states and 334 transitions. [2019-09-08 01:17:55,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 01:17:55,377 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 316 [2019-09-08 01:17:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:55,379 INFO L225 Difference]: With dead ends: 332 [2019-09-08 01:17:55,379 INFO L226 Difference]: Without dead ends: 325 [2019-09-08 01:17:55,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:17:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-08 01:17:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2019-09-08 01:17:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-08 01:17:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 323 transitions. [2019-09-08 01:17:55,383 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 323 transitions. Word has length 316 [2019-09-08 01:17:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:55,384 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 323 transitions. [2019-09-08 01:17:55,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-08 01:17:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 323 transitions. [2019-09-08 01:17:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 01:17:55,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:55,385 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:55,385 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash -212183336, now seen corresponding path program 75 times [2019-09-08 01:17:55,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:55,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:55,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:55,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:55,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:17:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:57,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:17:57,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:17:57,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:17:58,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-09-08 01:17:58,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:17:58,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 01:17:58,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:17:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:17:58,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:17:58,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-08 01:17:58,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-08 01:17:58,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-08 01:17:58,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:17:58,525 INFO L87 Difference]: Start difference. First operand 322 states and 323 transitions. Second operand 80 states. [2019-09-08 01:17:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:17:58,930 INFO L93 Difference]: Finished difference Result 336 states and 338 transitions. [2019-09-08 01:17:58,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-08 01:17:58,930 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 320 [2019-09-08 01:17:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:17:58,932 INFO L225 Difference]: With dead ends: 336 [2019-09-08 01:17:58,932 INFO L226 Difference]: Without dead ends: 329 [2019-09-08 01:17:58,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:17:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-08 01:17:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-09-08 01:17:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-08 01:17:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 327 transitions. [2019-09-08 01:17:58,938 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 327 transitions. Word has length 320 [2019-09-08 01:17:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:17:58,938 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 327 transitions. [2019-09-08 01:17:58,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-08 01:17:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 327 transitions. [2019-09-08 01:17:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 01:17:58,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:17:58,940 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:17:58,941 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:17:58,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:17:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1431944543, now seen corresponding path program 76 times [2019-09-08 01:17:58,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:17:58,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:17:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:58,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:17:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:17:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:01,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:01,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:01,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:18:01,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:18:01,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:01,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 2781 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 01:18:01,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:01,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:01,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-08 01:18:01,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-08 01:18:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-08 01:18:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:18:01,791 INFO L87 Difference]: Start difference. First operand 326 states and 327 transitions. Second operand 81 states. [2019-09-08 01:18:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:02,242 INFO L93 Difference]: Finished difference Result 340 states and 342 transitions. [2019-09-08 01:18:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 01:18:02,242 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 324 [2019-09-08 01:18:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:02,244 INFO L225 Difference]: With dead ends: 340 [2019-09-08 01:18:02,244 INFO L226 Difference]: Without dead ends: 333 [2019-09-08 01:18:02,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:18:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-08 01:18:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2019-09-08 01:18:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 01:18:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2019-09-08 01:18:02,249 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 324 [2019-09-08 01:18:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:02,249 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2019-09-08 01:18:02,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-08 01:18:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2019-09-08 01:18:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 01:18:02,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:02,252 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:02,252 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:02,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1151633510, now seen corresponding path program 77 times [2019-09-08 01:18:02,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:02,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:02,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:04,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:04,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:04,605 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:18:05,299 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2019-09-08 01:18:05,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:05,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 2815 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-08 01:18:05,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:05,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:05,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-08 01:18:05,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-08 01:18:05,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-08 01:18:05,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:18:05,410 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 82 states. [2019-09-08 01:18:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:05,834 INFO L93 Difference]: Finished difference Result 344 states and 346 transitions. [2019-09-08 01:18:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-08 01:18:05,835 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 328 [2019-09-08 01:18:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:05,836 INFO L225 Difference]: With dead ends: 344 [2019-09-08 01:18:05,836 INFO L226 Difference]: Without dead ends: 337 [2019-09-08 01:18:05,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:18:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-08 01:18:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 334. [2019-09-08 01:18:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-08 01:18:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2019-09-08 01:18:05,841 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 328 [2019-09-08 01:18:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:05,841 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2019-09-08 01:18:05,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-08 01:18:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2019-09-08 01:18:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 01:18:05,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:05,843 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:05,843 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1410041875, now seen corresponding path program 78 times [2019-09-08 01:18:05,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:05,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:05,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:05,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:05,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:08,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:08,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:08,276 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:18:09,016 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 81 check-sat command(s) [2019-09-08 01:18:09,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:09,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 2849 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-08 01:18:09,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:09,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:09,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-08 01:18:09,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-08 01:18:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-08 01:18:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:18:09,136 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 83 states. [2019-09-08 01:18:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:09,573 INFO L93 Difference]: Finished difference Result 348 states and 350 transitions. [2019-09-08 01:18:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 01:18:09,573 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 332 [2019-09-08 01:18:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:09,575 INFO L225 Difference]: With dead ends: 348 [2019-09-08 01:18:09,575 INFO L226 Difference]: Without dead ends: 341 [2019-09-08 01:18:09,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:18:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-08 01:18:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2019-09-08 01:18:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-08 01:18:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 339 transitions. [2019-09-08 01:18:09,580 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 339 transitions. Word has length 332 [2019-09-08 01:18:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:09,581 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 339 transitions. [2019-09-08 01:18:09,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-08 01:18:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 339 transitions. [2019-09-08 01:18:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 01:18:09,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:09,583 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:09,583 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash 52644852, now seen corresponding path program 79 times [2019-09-08 01:18:09,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:09,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:09,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:09,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:09,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:12,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:12,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:12,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:12,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 2883 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 01:18:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:12,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:12,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-08 01:18:12,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-08 01:18:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-08 01:18:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:18:12,584 INFO L87 Difference]: Start difference. First operand 338 states and 339 transitions. Second operand 84 states. [2019-09-08 01:18:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:12,951 INFO L93 Difference]: Finished difference Result 352 states and 354 transitions. [2019-09-08 01:18:12,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 01:18:12,952 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 336 [2019-09-08 01:18:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:12,953 INFO L225 Difference]: With dead ends: 352 [2019-09-08 01:18:12,953 INFO L226 Difference]: Without dead ends: 345 [2019-09-08 01:18:12,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:18:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-08 01:18:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2019-09-08 01:18:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-08 01:18:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 343 transitions. [2019-09-08 01:18:12,957 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 343 transitions. Word has length 336 [2019-09-08 01:18:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:12,958 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 343 transitions. [2019-09-08 01:18:12,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-08 01:18:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 343 transitions. [2019-09-08 01:18:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 01:18:12,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:12,959 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:12,959 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:12,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1087716229, now seen corresponding path program 80 times [2019-09-08 01:18:12,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:12,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:12,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:12,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:12,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:15,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:15,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:15,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:18:15,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:18:15,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:15,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 2917 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 01:18:15,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:16,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:16,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-08 01:18:16,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-08 01:18:16,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-08 01:18:16,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:18:16,098 INFO L87 Difference]: Start difference. First operand 342 states and 343 transitions. Second operand 85 states. [2019-09-08 01:18:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:16,537 INFO L93 Difference]: Finished difference Result 356 states and 358 transitions. [2019-09-08 01:18:16,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-08 01:18:16,537 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 340 [2019-09-08 01:18:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:16,539 INFO L225 Difference]: With dead ends: 356 [2019-09-08 01:18:16,539 INFO L226 Difference]: Without dead ends: 349 [2019-09-08 01:18:16,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:18:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-08 01:18:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-09-08 01:18:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-08 01:18:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 347 transitions. [2019-09-08 01:18:16,545 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 347 transitions. Word has length 340 [2019-09-08 01:18:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:16,546 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 347 transitions. [2019-09-08 01:18:16,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-08 01:18:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 347 transitions. [2019-09-08 01:18:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 01:18:16,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:16,548 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:16,548 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1037786750, now seen corresponding path program 81 times [2019-09-08 01:18:16,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:16,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:16,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:19,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:19,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:19,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:18:20,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-08 01:18:20,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:20,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-08 01:18:20,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:20,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:20,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-08 01:18:20,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-08 01:18:20,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-08 01:18:20,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:18:20,135 INFO L87 Difference]: Start difference. First operand 346 states and 347 transitions. Second operand 86 states. [2019-09-08 01:18:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:20,548 INFO L93 Difference]: Finished difference Result 360 states and 362 transitions. [2019-09-08 01:18:20,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-08 01:18:20,549 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 344 [2019-09-08 01:18:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:20,550 INFO L225 Difference]: With dead ends: 360 [2019-09-08 01:18:20,550 INFO L226 Difference]: Without dead ends: 353 [2019-09-08 01:18:20,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:18:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-08 01:18:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2019-09-08 01:18:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-09-08 01:18:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 351 transitions. [2019-09-08 01:18:20,556 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 351 transitions. Word has length 344 [2019-09-08 01:18:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:20,556 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 351 transitions. [2019-09-08 01:18:20,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-08 01:18:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 351 transitions. [2019-09-08 01:18:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-08 01:18:20,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:20,558 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:20,558 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:20,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash -884301047, now seen corresponding path program 82 times [2019-09-08 01:18:20,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:20,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:20,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:20,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:20,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:23,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:23,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:23,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:18:23,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:18:23,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:23,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 2985 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 01:18:23,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:23,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:23,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-08 01:18:23,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-08 01:18:23,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-08 01:18:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:18:23,835 INFO L87 Difference]: Start difference. First operand 350 states and 351 transitions. Second operand 87 states. [2019-09-08 01:18:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:24,311 INFO L93 Difference]: Finished difference Result 364 states and 366 transitions. [2019-09-08 01:18:24,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 01:18:24,312 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 348 [2019-09-08 01:18:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:24,313 INFO L225 Difference]: With dead ends: 364 [2019-09-08 01:18:24,314 INFO L226 Difference]: Without dead ends: 357 [2019-09-08 01:18:24,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:18:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-08 01:18:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 354. [2019-09-08 01:18:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-08 01:18:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 355 transitions. [2019-09-08 01:18:24,320 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 355 transitions. Word has length 348 [2019-09-08 01:18:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:24,321 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 355 transitions. [2019-09-08 01:18:24,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-08 01:18:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 355 transitions. [2019-09-08 01:18:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 01:18:24,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:24,323 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:24,323 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:24,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:24,323 INFO L82 PathProgramCache]: Analyzing trace with hash -420050672, now seen corresponding path program 83 times [2019-09-08 01:18:24,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:24,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:24,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:24,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:24,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:27,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:27,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:27,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:18:27,913 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 86 check-sat command(s) [2019-09-08 01:18:27,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:27,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 3019 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-08 01:18:27,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:28,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:28,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-09-08 01:18:28,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-08 01:18:28,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-08 01:18:28,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:18:28,010 INFO L87 Difference]: Start difference. First operand 354 states and 355 transitions. Second operand 88 states. [2019-09-08 01:18:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:28,446 INFO L93 Difference]: Finished difference Result 368 states and 370 transitions. [2019-09-08 01:18:28,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 01:18:28,447 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 352 [2019-09-08 01:18:28,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:28,449 INFO L225 Difference]: With dead ends: 368 [2019-09-08 01:18:28,449 INFO L226 Difference]: Without dead ends: 361 [2019-09-08 01:18:28,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:18:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-09-08 01:18:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 358. [2019-09-08 01:18:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-09-08 01:18:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 359 transitions. [2019-09-08 01:18:28,454 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 359 transitions. Word has length 352 [2019-09-08 01:18:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:28,454 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 359 transitions. [2019-09-08 01:18:28,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-08 01:18:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 359 transitions. [2019-09-08 01:18:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-08 01:18:28,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:28,456 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:28,456 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -559803497, now seen corresponding path program 84 times [2019-09-08 01:18:28,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:28,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:28,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:31,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:31,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:31,289 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:18:32,134 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2019-09-08 01:18:32,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:32,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 01:18:32,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:32,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:32,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-08 01:18:32,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-08 01:18:32,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-08 01:18:32,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:18:32,232 INFO L87 Difference]: Start difference. First operand 358 states and 359 transitions. Second operand 89 states. [2019-09-08 01:18:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:32,676 INFO L93 Difference]: Finished difference Result 372 states and 374 transitions. [2019-09-08 01:18:32,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 01:18:32,677 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 356 [2019-09-08 01:18:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:32,678 INFO L225 Difference]: With dead ends: 372 [2019-09-08 01:18:32,678 INFO L226 Difference]: Without dead ends: 365 [2019-09-08 01:18:32,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:18:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-08 01:18:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2019-09-08 01:18:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-08 01:18:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2019-09-08 01:18:32,684 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 356 [2019-09-08 01:18:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:32,684 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2019-09-08 01:18:32,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-08 01:18:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2019-09-08 01:18:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-08 01:18:32,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:32,686 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:32,686 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:32,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1461255522, now seen corresponding path program 85 times [2019-09-08 01:18:32,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:32,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:32,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:35,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:35,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:35,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:35,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 3087 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-08 01:18:35,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:36,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:36,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-08 01:18:36,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-08 01:18:36,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-08 01:18:36,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:18:36,083 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 90 states. [2019-09-08 01:18:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:36,510 INFO L93 Difference]: Finished difference Result 376 states and 378 transitions. [2019-09-08 01:18:36,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 01:18:36,510 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 360 [2019-09-08 01:18:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:36,513 INFO L225 Difference]: With dead ends: 376 [2019-09-08 01:18:36,513 INFO L226 Difference]: Without dead ends: 369 [2019-09-08 01:18:36,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:18:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-08 01:18:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-09-08 01:18:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-08 01:18:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 367 transitions. [2019-09-08 01:18:36,519 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 367 transitions. Word has length 360 [2019-09-08 01:18:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:36,519 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 367 transitions. [2019-09-08 01:18:36,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-08 01:18:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 367 transitions. [2019-09-08 01:18:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 01:18:36,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:36,521 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:36,521 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash -645982683, now seen corresponding path program 86 times [2019-09-08 01:18:36,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:36,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:36,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:18:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:39,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:39,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:39,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:18:39,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:18:39,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:39,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 3121 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-08 01:18:39,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:40,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:40,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-08 01:18:40,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-08 01:18:40,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-08 01:18:40,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:18:40,048 INFO L87 Difference]: Start difference. First operand 366 states and 367 transitions. Second operand 91 states. [2019-09-08 01:18:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:40,592 INFO L93 Difference]: Finished difference Result 380 states and 382 transitions. [2019-09-08 01:18:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 01:18:40,592 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 364 [2019-09-08 01:18:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:40,594 INFO L225 Difference]: With dead ends: 380 [2019-09-08 01:18:40,594 INFO L226 Difference]: Without dead ends: 373 [2019-09-08 01:18:40,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:18:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-08 01:18:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 370. [2019-09-08 01:18:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 01:18:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 371 transitions. [2019-09-08 01:18:40,600 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 371 transitions. Word has length 364 [2019-09-08 01:18:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:40,600 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 371 transitions. [2019-09-08 01:18:40,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-08 01:18:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 371 transitions. [2019-09-08 01:18:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-08 01:18:40,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:40,602 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:40,602 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:40,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:40,603 INFO L82 PathProgramCache]: Analyzing trace with hash 289672748, now seen corresponding path program 87 times [2019-09-08 01:18:40,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:40,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:40,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:40,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:43,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:43,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:43,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:18:44,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-09-08 01:18:44,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:44,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 3155 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 01:18:44,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:44,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:44,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-08 01:18:44,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-08 01:18:44,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-08 01:18:44,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:18:44,647 INFO L87 Difference]: Start difference. First operand 370 states and 371 transitions. Second operand 92 states. [2019-09-08 01:18:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:45,134 INFO L93 Difference]: Finished difference Result 384 states and 386 transitions. [2019-09-08 01:18:45,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-08 01:18:45,135 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 368 [2019-09-08 01:18:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:45,136 INFO L225 Difference]: With dead ends: 384 [2019-09-08 01:18:45,136 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 01:18:45,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:18:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 01:18:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2019-09-08 01:18:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-08 01:18:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 375 transitions. [2019-09-08 01:18:45,141 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 375 transitions. Word has length 368 [2019-09-08 01:18:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:45,142 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 375 transitions. [2019-09-08 01:18:45,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-08 01:18:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 375 transitions. [2019-09-08 01:18:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 01:18:45,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:45,143 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:45,144 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1848617651, now seen corresponding path program 88 times [2019-09-08 01:18:45,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:45,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:45,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:48,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:48,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:48,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:18:48,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:18:48,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:48,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 01:18:48,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:48,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:48,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-08 01:18:48,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-08 01:18:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-08 01:18:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:18:48,843 INFO L87 Difference]: Start difference. First operand 374 states and 375 transitions. Second operand 93 states. [2019-09-08 01:18:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:49,298 INFO L93 Difference]: Finished difference Result 388 states and 390 transitions. [2019-09-08 01:18:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-08 01:18:49,298 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 372 [2019-09-08 01:18:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:49,300 INFO L225 Difference]: With dead ends: 388 [2019-09-08 01:18:49,301 INFO L226 Difference]: Without dead ends: 381 [2019-09-08 01:18:49,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:18:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-08 01:18:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 378. [2019-09-08 01:18:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-09-08 01:18:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2019-09-08 01:18:49,306 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 372 [2019-09-08 01:18:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:49,306 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2019-09-08 01:18:49,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-08 01:18:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2019-09-08 01:18:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 01:18:49,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:49,308 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:49,308 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:49,308 INFO L82 PathProgramCache]: Analyzing trace with hash -77878342, now seen corresponding path program 89 times [2019-09-08 01:18:49,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:49,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:49,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:52,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:52,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:52,437 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:18:53,330 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 92 check-sat command(s) [2019-09-08 01:18:53,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:53,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 3223 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-08 01:18:53,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:53,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:53,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-08 01:18:53,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-08 01:18:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-08 01:18:53,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:18:53,439 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 94 states. [2019-09-08 01:18:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:53,814 INFO L93 Difference]: Finished difference Result 392 states and 394 transitions. [2019-09-08 01:18:53,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-08 01:18:53,814 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 376 [2019-09-08 01:18:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:53,816 INFO L225 Difference]: With dead ends: 392 [2019-09-08 01:18:53,816 INFO L226 Difference]: Without dead ends: 385 [2019-09-08 01:18:53,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:18:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-08 01:18:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2019-09-08 01:18:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-08 01:18:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 383 transitions. [2019-09-08 01:18:53,821 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 383 transitions. Word has length 376 [2019-09-08 01:18:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:53,821 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 383 transitions. [2019-09-08 01:18:53,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-08 01:18:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 383 transitions. [2019-09-08 01:18:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-08 01:18:53,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:53,823 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:53,823 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:53,823 INFO L82 PathProgramCache]: Analyzing trace with hash 553767233, now seen corresponding path program 90 times [2019-09-08 01:18:53,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:53,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:53,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:18:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:57,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:18:57,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:18:57,073 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:18:58,010 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 93 check-sat command(s) [2019-09-08 01:18:58,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:18:58,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 3257 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-08 01:18:58,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:18:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:18:58,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:18:58,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-08 01:18:58,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-08 01:18:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-08 01:18:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:18:58,123 INFO L87 Difference]: Start difference. First operand 382 states and 383 transitions. Second operand 95 states. [2019-09-08 01:18:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:18:58,625 INFO L93 Difference]: Finished difference Result 396 states and 398 transitions. [2019-09-08 01:18:58,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 01:18:58,626 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 380 [2019-09-08 01:18:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:18:58,628 INFO L225 Difference]: With dead ends: 396 [2019-09-08 01:18:58,628 INFO L226 Difference]: Without dead ends: 389 [2019-09-08 01:18:58,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:18:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-08 01:18:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-09-08 01:18:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-09-08 01:18:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 387 transitions. [2019-09-08 01:18:58,636 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 387 transitions. Word has length 380 [2019-09-08 01:18:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:18:58,636 INFO L475 AbstractCegarLoop]: Abstraction has 386 states and 387 transitions. [2019-09-08 01:18:58,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-08 01:18:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 387 transitions. [2019-09-08 01:18:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-08 01:18:58,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:18:58,638 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:18:58,638 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:18:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:18:58,638 INFO L82 PathProgramCache]: Analyzing trace with hash 343661384, now seen corresponding path program 91 times [2019-09-08 01:18:58,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:18:58,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:18:58,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:58,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:18:58,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:18:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:02,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:02,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:19:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:02,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-08 01:19:02,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:02,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:02,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-08 01:19:02,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-08 01:19:02,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-08 01:19:02,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:19:02,724 INFO L87 Difference]: Start difference. First operand 386 states and 387 transitions. Second operand 96 states. [2019-09-08 01:19:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:03,331 INFO L93 Difference]: Finished difference Result 400 states and 402 transitions. [2019-09-08 01:19:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-08 01:19:03,331 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 384 [2019-09-08 01:19:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:03,333 INFO L225 Difference]: With dead ends: 400 [2019-09-08 01:19:03,333 INFO L226 Difference]: Without dead ends: 393 [2019-09-08 01:19:03,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:19:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-08 01:19:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2019-09-08 01:19:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-08 01:19:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 391 transitions. [2019-09-08 01:19:03,339 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 391 transitions. Word has length 384 [2019-09-08 01:19:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:03,339 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 391 transitions. [2019-09-08 01:19:03,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-08 01:19:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 391 transitions. [2019-09-08 01:19:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 01:19:03,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:03,341 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:03,341 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1212385743, now seen corresponding path program 92 times [2019-09-08 01:19:03,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:03,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:03,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:03,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:19:03,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:06,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:06,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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:06,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:19:07,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:19:07,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:07,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 3325 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-08 01:19:07,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:07,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:07,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-08 01:19:07,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-08 01:19:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-08 01:19:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:19:07,302 INFO L87 Difference]: Start difference. First operand 390 states and 391 transitions. Second operand 97 states. [2019-09-08 01:19:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:07,935 INFO L93 Difference]: Finished difference Result 404 states and 406 transitions. [2019-09-08 01:19:07,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-08 01:19:07,935 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 388 [2019-09-08 01:19:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:07,937 INFO L225 Difference]: With dead ends: 404 [2019-09-08 01:19:07,938 INFO L226 Difference]: Without dead ends: 397 [2019-09-08 01:19:07,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:19:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-09-08 01:19:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 394. [2019-09-08 01:19:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-08 01:19:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 395 transitions. [2019-09-08 01:19:07,944 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 395 transitions. Word has length 388 [2019-09-08 01:19:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:07,944 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 395 transitions. [2019-09-08 01:19:07,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-08 01:19:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 395 transitions. [2019-09-08 01:19:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 01:19:07,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:07,946 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:07,946 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:07,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash -604857130, now seen corresponding path program 93 times [2019-09-08 01:19:07,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:07,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:07,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:07,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:07,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:11,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:11,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:11,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:19:12,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-09-08 01:19:12,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:12,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 3359 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-08 01:19:12,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:12,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:12,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-08 01:19:12,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-08 01:19:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-08 01:19:12,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:19:12,526 INFO L87 Difference]: Start difference. First operand 394 states and 395 transitions. Second operand 98 states. [2019-09-08 01:19:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:13,106 INFO L93 Difference]: Finished difference Result 408 states and 410 transitions. [2019-09-08 01:19:13,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-08 01:19:13,106 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 392 [2019-09-08 01:19:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:13,108 INFO L225 Difference]: With dead ends: 408 [2019-09-08 01:19:13,108 INFO L226 Difference]: Without dead ends: 401 [2019-09-08 01:19:13,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:19:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-09-08 01:19:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 398. [2019-09-08 01:19:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-08 01:19:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 399 transitions. [2019-09-08 01:19:13,114 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 399 transitions. Word has length 392 [2019-09-08 01:19:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:13,114 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 399 transitions. [2019-09-08 01:19:13,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-08 01:19:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 399 transitions. [2019-09-08 01:19:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-08 01:19:13,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:13,116 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:13,116 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:13,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:13,116 INFO L82 PathProgramCache]: Analyzing trace with hash 205706333, now seen corresponding path program 94 times [2019-09-08 01:19:13,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:13,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:13,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:13,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:13,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:16,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:16,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:16,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:19:17,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:19:17,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:17,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 3393 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-08 01:19:17,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:17,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:17,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-08 01:19:17,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-08 01:19:17,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-08 01:19:17,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:19:17,178 INFO L87 Difference]: Start difference. First operand 398 states and 399 transitions. Second operand 99 states. [2019-09-08 01:19:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:17,654 INFO L93 Difference]: Finished difference Result 412 states and 414 transitions. [2019-09-08 01:19:17,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 01:19:17,655 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 396 [2019-09-08 01:19:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:17,656 INFO L225 Difference]: With dead ends: 412 [2019-09-08 01:19:17,656 INFO L226 Difference]: Without dead ends: 405 [2019-09-08 01:19:17,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:19:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-08 01:19:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-09-08 01:19:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-08 01:19:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 403 transitions. [2019-09-08 01:19:17,661 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 403 transitions. Word has length 396 [2019-09-08 01:19:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:17,662 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 403 transitions. [2019-09-08 01:19:17,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-08 01:19:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 403 transitions. [2019-09-08 01:19:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-08 01:19:17,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:17,664 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:17,664 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:17,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1559367580, now seen corresponding path program 95 times [2019-09-08 01:19:17,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:17,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:17,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:21,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:21,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:19:22,214 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 98 check-sat command(s) [2019-09-08 01:19:22,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:22,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 3427 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-08 01:19:22,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:22,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:22,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-08 01:19:22,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-08 01:19:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-08 01:19:22,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:19:22,332 INFO L87 Difference]: Start difference. First operand 402 states and 403 transitions. Second operand 100 states. [2019-09-08 01:19:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:22,996 INFO L93 Difference]: Finished difference Result 416 states and 418 transitions. [2019-09-08 01:19:22,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 01:19:22,997 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 400 [2019-09-08 01:19:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:22,998 INFO L225 Difference]: With dead ends: 416 [2019-09-08 01:19:22,999 INFO L226 Difference]: Without dead ends: 409 [2019-09-08 01:19:22,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:19:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-09-08 01:19:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-09-08 01:19:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-09-08 01:19:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 407 transitions. [2019-09-08 01:19:23,004 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 407 transitions. Word has length 400 [2019-09-08 01:19:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:23,004 INFO L475 AbstractCegarLoop]: Abstraction has 406 states and 407 transitions. [2019-09-08 01:19:23,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-08 01:19:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 407 transitions. [2019-09-08 01:19:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 01:19:23,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:23,006 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:23,006 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1733144811, now seen corresponding path program 96 times [2019-09-08 01:19:23,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:23,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:23,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:23,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:26,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:26,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:26,698 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:19:27,748 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 99 check-sat command(s) [2019-09-08 01:19:27,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:27,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 3461 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-08 01:19:27,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:27,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:27,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-08 01:19:27,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-08 01:19:27,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-08 01:19:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:19:27,871 INFO L87 Difference]: Start difference. First operand 406 states and 407 transitions. Second operand 101 states. [2019-09-08 01:19:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:28,507 INFO L93 Difference]: Finished difference Result 420 states and 422 transitions. [2019-09-08 01:19:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 01:19:28,507 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 404 [2019-09-08 01:19:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:28,509 INFO L225 Difference]: With dead ends: 420 [2019-09-08 01:19:28,509 INFO L226 Difference]: Without dead ends: 413 [2019-09-08 01:19:28,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:19:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-08 01:19:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2019-09-08 01:19:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-08 01:19:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2019-09-08 01:19:28,514 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 404 [2019-09-08 01:19:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:28,514 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2019-09-08 01:19:28,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-08 01:19:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2019-09-08 01:19:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-09-08 01:19:28,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:28,516 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:28,516 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1927555598, now seen corresponding path program 97 times [2019-09-08 01:19:28,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:28,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:28,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:32,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:32,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:32,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:19:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:32,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 3495 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 01:19:32,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:32,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:32,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-08 01:19:32,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-08 01:19:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-08 01:19:32,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:19:32,828 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 102 states. [2019-09-08 01:19:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:33,468 INFO L93 Difference]: Finished difference Result 424 states and 426 transitions. [2019-09-08 01:19:33,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-08 01:19:33,469 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 408 [2019-09-08 01:19:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:33,470 INFO L225 Difference]: With dead ends: 424 [2019-09-08 01:19:33,471 INFO L226 Difference]: Without dead ends: 417 [2019-09-08 01:19:33,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:19:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-08 01:19:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2019-09-08 01:19:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-09-08 01:19:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 415 transitions. [2019-09-08 01:19:33,478 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 415 transitions. Word has length 408 [2019-09-08 01:19:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:33,479 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 415 transitions. [2019-09-08 01:19:33,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-08 01:19:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 415 transitions. [2019-09-08 01:19:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 01:19:33,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:33,481 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:33,481 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash 632430457, now seen corresponding path program 98 times [2019-09-08 01:19:33,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:33,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:33,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:33,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:19:33,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:37,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:37,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:37,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:19:37,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:19:37,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:37,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 3529 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-08 01:19:37,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:37,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:37,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-09-08 01:19:37,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-08 01:19:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-08 01:19:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 01:19:37,850 INFO L87 Difference]: Start difference. First operand 414 states and 415 transitions. Second operand 103 states. [2019-09-08 01:19:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:38,577 INFO L93 Difference]: Finished difference Result 428 states and 430 transitions. [2019-09-08 01:19:38,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-08 01:19:38,577 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 412 [2019-09-08 01:19:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:38,579 INFO L225 Difference]: With dead ends: 428 [2019-09-08 01:19:38,579 INFO L226 Difference]: Without dead ends: 421 [2019-09-08 01:19:38,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 01:19:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-08 01:19:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2019-09-08 01:19:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-08 01:19:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 419 transitions. [2019-09-08 01:19:38,586 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 419 transitions. Word has length 412 [2019-09-08 01:19:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:38,587 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 419 transitions. [2019-09-08 01:19:38,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-08 01:19:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 419 transitions. [2019-09-08 01:19:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 01:19:38,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:38,589 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:38,589 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:38,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1888858752, now seen corresponding path program 99 times [2019-09-08 01:19:38,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:38,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:38,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:38,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:38,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:42,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:42,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:42,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:19:43,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2019-09-08 01:19:43,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:43,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 3563 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-08 01:19:43,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:43,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:43,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-09-08 01:19:43,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-08 01:19:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-08 01:19:43,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 01:19:43,703 INFO L87 Difference]: Start difference. First operand 418 states and 419 transitions. Second operand 104 states. [2019-09-08 01:19:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:44,336 INFO L93 Difference]: Finished difference Result 432 states and 434 transitions. [2019-09-08 01:19:44,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-08 01:19:44,336 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 416 [2019-09-08 01:19:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:44,337 INFO L225 Difference]: With dead ends: 432 [2019-09-08 01:19:44,337 INFO L226 Difference]: Without dead ends: 425 [2019-09-08 01:19:44,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 01:19:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-09-08 01:19:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2019-09-08 01:19:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-08 01:19:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 423 transitions. [2019-09-08 01:19:44,342 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 423 transitions. Word has length 416 [2019-09-08 01:19:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:44,342 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 423 transitions. [2019-09-08 01:19:44,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-08 01:19:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 423 transitions. [2019-09-08 01:19:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-08 01:19:44,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:44,344 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:44,344 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:44,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:44,345 INFO L82 PathProgramCache]: Analyzing trace with hash -440524793, now seen corresponding path program 100 times [2019-09-08 01:19:44,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:44,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:44,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:48,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:48,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:19:48,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:19:48,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:48,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 3597 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-08 01:19:48,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:48,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:48,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2019-09-08 01:19:48,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-08 01:19:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-08 01:19:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-08 01:19:48,907 INFO L87 Difference]: Start difference. First operand 422 states and 423 transitions. Second operand 105 states. [2019-09-08 01:19:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:49,620 INFO L93 Difference]: Finished difference Result 436 states and 438 transitions. [2019-09-08 01:19:49,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-08 01:19:49,621 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 420 [2019-09-08 01:19:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:49,622 INFO L225 Difference]: With dead ends: 436 [2019-09-08 01:19:49,622 INFO L226 Difference]: Without dead ends: 429 [2019-09-08 01:19:49,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-09-08 01:19:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-09-08 01:19:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-09-08 01:19:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 01:19:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 427 transitions. [2019-09-08 01:19:49,628 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 427 transitions. Word has length 420 [2019-09-08 01:19:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:49,628 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 427 transitions. [2019-09-08 01:19:49,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-08 01:19:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 427 transitions. [2019-09-08 01:19:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 01:19:49,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:49,630 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:49,630 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1900500750, now seen corresponding path program 101 times [2019-09-08 01:19:49,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:49,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:53,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:53,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:53,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:19:54,710 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 104 check-sat command(s) [2019-09-08 01:19:54,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:19:54,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 3631 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-08 01:19:54,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:19:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:54,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:19:54,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2019-09-08 01:19:54,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-08 01:19:54,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-08 01:19:54,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 01:19:54,898 INFO L87 Difference]: Start difference. First operand 426 states and 427 transitions. Second operand 106 states. [2019-09-08 01:19:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:19:55,409 INFO L93 Difference]: Finished difference Result 440 states and 442 transitions. [2019-09-08 01:19:55,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-08 01:19:55,409 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 424 [2019-09-08 01:19:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:19:55,410 INFO L225 Difference]: With dead ends: 440 [2019-09-08 01:19:55,411 INFO L226 Difference]: Without dead ends: 433 [2019-09-08 01:19:55,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 01:19:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-08 01:19:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2019-09-08 01:19:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-08 01:19:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 431 transitions. [2019-09-08 01:19:55,417 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 431 transitions. Word has length 424 [2019-09-08 01:19:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:19:55,418 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 431 transitions. [2019-09-08 01:19:55,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-08 01:19:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 431 transitions. [2019-09-08 01:19:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-08 01:19:55,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:19:55,420 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:19:55,420 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:19:55,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:19:55,421 INFO L82 PathProgramCache]: Analyzing trace with hash 398439061, now seen corresponding path program 102 times [2019-09-08 01:19:55,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:19:55,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:19:55,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:55,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:19:55,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:19:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:19:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:19:59,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:19:59,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:19:59,463 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:20:00,613 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 105 check-sat command(s) [2019-09-08 01:20:00,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:00,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 3665 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-08 01:20:00,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:00,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:00,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2019-09-08 01:20:00,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-08 01:20:00,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-08 01:20:00,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 01:20:00,759 INFO L87 Difference]: Start difference. First operand 430 states and 431 transitions. Second operand 107 states. [2019-09-08 01:20:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:01,343 INFO L93 Difference]: Finished difference Result 444 states and 446 transitions. [2019-09-08 01:20:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-08 01:20:01,344 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 428 [2019-09-08 01:20:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:01,345 INFO L225 Difference]: With dead ends: 444 [2019-09-08 01:20:01,345 INFO L226 Difference]: Without dead ends: 437 [2019-09-08 01:20:01,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-09-08 01:20:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-08 01:20:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2019-09-08 01:20:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-08 01:20:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2019-09-08 01:20:01,350 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 428 [2019-09-08 01:20:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:01,350 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2019-09-08 01:20:01,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-08 01:20:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2019-09-08 01:20:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-09-08 01:20:01,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:01,352 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:01,352 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash -872353124, now seen corresponding path program 103 times [2019-09-08 01:20:01,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:01,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:01,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:05,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:05,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:05,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:06,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 3699 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-08 01:20:06,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:06,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:06,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2019-09-08 01:20:06,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-08 01:20:06,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-08 01:20:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 01:20:06,220 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 108 states. [2019-09-08 01:20:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:06,744 INFO L93 Difference]: Finished difference Result 448 states and 450 transitions. [2019-09-08 01:20:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-08 01:20:06,744 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 432 [2019-09-08 01:20:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:06,745 INFO L225 Difference]: With dead ends: 448 [2019-09-08 01:20:06,745 INFO L226 Difference]: Without dead ends: 441 [2019-09-08 01:20:06,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 01:20:06,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-09-08 01:20:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 438. [2019-09-08 01:20:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-09-08 01:20:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 439 transitions. [2019-09-08 01:20:06,750 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 439 transitions. Word has length 432 [2019-09-08 01:20:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:06,751 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 439 transitions. [2019-09-08 01:20:06,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-08 01:20:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 439 transitions. [2019-09-08 01:20:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-08 01:20:06,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:06,752 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:06,753 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:06,753 INFO L82 PathProgramCache]: Analyzing trace with hash -33237213, now seen corresponding path program 104 times [2019-09-08 01:20:06,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:06,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:06,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:11,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:11,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:11,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:20:11,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:20:11,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:11,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 3733 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-08 01:20:11,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:11,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:11,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2019-09-08 01:20:11,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-08 01:20:11,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-08 01:20:11,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 01:20:11,680 INFO L87 Difference]: Start difference. First operand 438 states and 439 transitions. Second operand 109 states. [2019-09-08 01:20:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:12,468 INFO L93 Difference]: Finished difference Result 452 states and 454 transitions. [2019-09-08 01:20:12,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-08 01:20:12,469 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 436 [2019-09-08 01:20:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:12,470 INFO L225 Difference]: With dead ends: 452 [2019-09-08 01:20:12,470 INFO L226 Difference]: Without dead ends: 445 [2019-09-08 01:20:12,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 01:20:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-09-08 01:20:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 442. [2019-09-08 01:20:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-08 01:20:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 443 transitions. [2019-09-08 01:20:12,476 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 443 transitions. Word has length 436 [2019-09-08 01:20:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:12,477 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 443 transitions. [2019-09-08 01:20:12,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-08 01:20:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 443 transitions. [2019-09-08 01:20:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-09-08 01:20:12,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:12,479 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:12,480 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash 182788138, now seen corresponding path program 105 times [2019-09-08 01:20:12,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:12,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:12,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:12,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:16,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:16,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:16,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:20:18,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2019-09-08 01:20:18,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:18,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 3767 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-08 01:20:18,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:18,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:18,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2019-09-08 01:20:18,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-08 01:20:18,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-08 01:20:18,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 01:20:18,240 INFO L87 Difference]: Start difference. First operand 442 states and 443 transitions. Second operand 110 states. [2019-09-08 01:20:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:18,866 INFO L93 Difference]: Finished difference Result 456 states and 458 transitions. [2019-09-08 01:20:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-08 01:20:18,866 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 440 [2019-09-08 01:20:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:18,867 INFO L225 Difference]: With dead ends: 456 [2019-09-08 01:20:18,867 INFO L226 Difference]: Without dead ends: 449 [2019-09-08 01:20:18,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-08 01:20:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-08 01:20:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2019-09-08 01:20:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-08 01:20:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 447 transitions. [2019-09-08 01:20:18,872 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 447 transitions. Word has length 440 [2019-09-08 01:20:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:18,873 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 447 transitions. [2019-09-08 01:20:18,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-08 01:20:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 447 transitions. [2019-09-08 01:20:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-08 01:20:18,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:18,875 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:18,875 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:18,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1394897487, now seen corresponding path program 106 times [2019-09-08 01:20:18,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:18,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:18,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:18,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:18,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:23,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:23,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:23,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:20:23,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:20:23,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:23,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 3801 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-08 01:20:23,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:23,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:23,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2019-09-08 01:20:23,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-08 01:20:23,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-08 01:20:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 01:20:23,920 INFO L87 Difference]: Start difference. First operand 446 states and 447 transitions. Second operand 111 states. [2019-09-08 01:20:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:24,800 INFO L93 Difference]: Finished difference Result 460 states and 462 transitions. [2019-09-08 01:20:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-08 01:20:24,800 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 444 [2019-09-08 01:20:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:24,801 INFO L225 Difference]: With dead ends: 460 [2019-09-08 01:20:24,802 INFO L226 Difference]: Without dead ends: 453 [2019-09-08 01:20:24,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-09-08 01:20:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-08 01:20:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 450. [2019-09-08 01:20:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 01:20:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 451 transitions. [2019-09-08 01:20:24,807 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 451 transitions. Word has length 444 [2019-09-08 01:20:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:24,807 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 451 transitions. [2019-09-08 01:20:24,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-08 01:20:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 451 transitions. [2019-09-08 01:20:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-08 01:20:24,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:24,809 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:24,809 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:24,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1799479224, now seen corresponding path program 107 times [2019-09-08 01:20:24,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:24,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:24,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:29,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:29,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:29,336 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:20:30,517 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 110 check-sat command(s) [2019-09-08 01:20:30,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:30,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 3835 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-08 01:20:30,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:30,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:30,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2019-09-08 01:20:30,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-08 01:20:30,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-08 01:20:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 01:20:30,664 INFO L87 Difference]: Start difference. First operand 450 states and 451 transitions. Second operand 112 states. [2019-09-08 01:20:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:31,631 INFO L93 Difference]: Finished difference Result 464 states and 466 transitions. [2019-09-08 01:20:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-08 01:20:31,632 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 448 [2019-09-08 01:20:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:31,633 INFO L225 Difference]: With dead ends: 464 [2019-09-08 01:20:31,633 INFO L226 Difference]: Without dead ends: 457 [2019-09-08 01:20:31,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-08 01:20:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-08 01:20:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 454. [2019-09-08 01:20:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-09-08 01:20:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 455 transitions. [2019-09-08 01:20:31,637 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 455 transitions. Word has length 448 [2019-09-08 01:20:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:31,638 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 455 transitions. [2019-09-08 01:20:31,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-08 01:20:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 455 transitions. [2019-09-08 01:20:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-08 01:20:31,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:31,640 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:31,640 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash 177329727, now seen corresponding path program 108 times [2019-09-08 01:20:31,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:31,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:31,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:36,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:36,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:36,139 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:20:37,403 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 111 check-sat command(s) [2019-09-08 01:20:37,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:37,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 3869 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-08 01:20:37,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:37,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:37,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2019-09-08 01:20:37,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-08 01:20:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-08 01:20:37,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 01:20:37,554 INFO L87 Difference]: Start difference. First operand 454 states and 455 transitions. Second operand 113 states. [2019-09-08 01:20:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:38,362 INFO L93 Difference]: Finished difference Result 468 states and 470 transitions. [2019-09-08 01:20:38,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-08 01:20:38,367 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 452 [2019-09-08 01:20:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:38,368 INFO L225 Difference]: With dead ends: 468 [2019-09-08 01:20:38,368 INFO L226 Difference]: Without dead ends: 461 [2019-09-08 01:20:38,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 01:20:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-08 01:20:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 458. [2019-09-08 01:20:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-09-08 01:20:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 459 transitions. [2019-09-08 01:20:38,376 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 459 transitions. Word has length 452 [2019-09-08 01:20:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:38,377 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 459 transitions. [2019-09-08 01:20:38,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-08 01:20:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 459 transitions. [2019-09-08 01:20:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-09-08 01:20:38,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:38,379 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:38,379 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:38,379 INFO L82 PathProgramCache]: Analyzing trace with hash -60477114, now seen corresponding path program 109 times [2019-09-08 01:20:38,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:38,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:38,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:38,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:38,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:43,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:43,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:43,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:43,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 3903 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-08 01:20:43,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:43,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:43,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2019-09-08 01:20:43,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-08 01:20:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-08 01:20:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-08 01:20:43,677 INFO L87 Difference]: Start difference. First operand 458 states and 459 transitions. Second operand 114 states. [2019-09-08 01:20:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:44,478 INFO L93 Difference]: Finished difference Result 472 states and 474 transitions. [2019-09-08 01:20:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-08 01:20:44,479 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 456 [2019-09-08 01:20:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:44,480 INFO L225 Difference]: With dead ends: 472 [2019-09-08 01:20:44,480 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 01:20:44,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-08 01:20:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 01:20:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 462. [2019-09-08 01:20:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-09-08 01:20:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 463 transitions. [2019-09-08 01:20:44,485 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 463 transitions. Word has length 456 [2019-09-08 01:20:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:44,485 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 463 transitions. [2019-09-08 01:20:44,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-08 01:20:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 463 transitions. [2019-09-08 01:20:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-09-08 01:20:44,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:44,487 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:44,487 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash -814370611, now seen corresponding path program 110 times [2019-09-08 01:20:44,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:44,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:44,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:20:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:49,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:49,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:49,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:20:49,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:20:49,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:49,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 3937 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-08 01:20:49,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:49,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:49,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2019-09-08 01:20:49,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-08 01:20:49,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-08 01:20:49,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 01:20:49,973 INFO L87 Difference]: Start difference. First operand 462 states and 463 transitions. Second operand 115 states. [2019-09-08 01:20:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:50,871 INFO L93 Difference]: Finished difference Result 476 states and 478 transitions. [2019-09-08 01:20:50,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-08 01:20:50,872 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 460 [2019-09-08 01:20:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:50,873 INFO L225 Difference]: With dead ends: 476 [2019-09-08 01:20:50,873 INFO L226 Difference]: Without dead ends: 469 [2019-09-08 01:20:50,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-09-08 01:20:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-09-08 01:20:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 466. [2019-09-08 01:20:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 01:20:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 467 transitions. [2019-09-08 01:20:50,879 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 467 transitions. Word has length 460 [2019-09-08 01:20:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:50,879 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 467 transitions. [2019-09-08 01:20:50,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-08 01:20:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 467 transitions. [2019-09-08 01:20:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-09-08 01:20:50,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:50,881 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:50,881 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1617095468, now seen corresponding path program 111 times [2019-09-08 01:20:50,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:50,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:20:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:55,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:20:55,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:20:55,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:20:56,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 114 check-sat command(s) [2019-09-08 01:20:56,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:20:56,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 3971 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-08 01:20:56,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:20:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:20:56,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:20:56,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2019-09-08 01:20:56,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-08 01:20:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-08 01:20:56,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 01:20:56,961 INFO L87 Difference]: Start difference. First operand 466 states and 467 transitions. Second operand 116 states. [2019-09-08 01:20:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:20:57,470 INFO L93 Difference]: Finished difference Result 480 states and 482 transitions. [2019-09-08 01:20:57,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-08 01:20:57,470 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 464 [2019-09-08 01:20:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:20:57,471 INFO L225 Difference]: With dead ends: 480 [2019-09-08 01:20:57,471 INFO L226 Difference]: Without dead ends: 473 [2019-09-08 01:20:57,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 01:20:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-09-08 01:20:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 470. [2019-09-08 01:20:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 01:20:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 471 transitions. [2019-09-08 01:20:57,478 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 471 transitions. Word has length 464 [2019-09-08 01:20:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:20:57,478 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 471 transitions. [2019-09-08 01:20:57,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-08 01:20:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 471 transitions. [2019-09-08 01:20:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-08 01:20:57,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:20:57,480 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:20:57,480 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:20:57,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:20:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2049630885, now seen corresponding path program 112 times [2019-09-08 01:20:57,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:20:57,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:20:57,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:57,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:20:57,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:20:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:02,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:02,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:02,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:21:03,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:21:03,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:03,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 4005 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-08 01:21:03,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:03,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:03,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2019-09-08 01:21:03,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-08 01:21:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-08 01:21:03,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 01:21:03,161 INFO L87 Difference]: Start difference. First operand 470 states and 471 transitions. Second operand 117 states. [2019-09-08 01:21:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:03,958 INFO L93 Difference]: Finished difference Result 484 states and 486 transitions. [2019-09-08 01:21:03,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-08 01:21:03,959 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 468 [2019-09-08 01:21:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:03,960 INFO L225 Difference]: With dead ends: 484 [2019-09-08 01:21:03,960 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 01:21:03,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-09-08 01:21:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 01:21:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-09-08 01:21:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-09-08 01:21:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 475 transitions. [2019-09-08 01:21:03,964 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 475 transitions. Word has length 468 [2019-09-08 01:21:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:03,965 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 475 transitions. [2019-09-08 01:21:03,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-08 01:21:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 475 transitions. [2019-09-08 01:21:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-09-08 01:21:03,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:03,966 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:03,967 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:03,967 INFO L82 PathProgramCache]: Analyzing trace with hash 137857634, now seen corresponding path program 113 times [2019-09-08 01:21:03,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:03,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:03,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:03,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:03,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 26335 backedges. 0 proven. 26335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:08,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:08,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:08,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:21:10,267 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 116 check-sat command(s) [2019-09-08 01:21:10,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:10,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 4039 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-08 01:21:10,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 26335 backedges. 0 proven. 26335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:10,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:10,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2019-09-08 01:21:10,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-08 01:21:10,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-08 01:21:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 01:21:10,423 INFO L87 Difference]: Start difference. First operand 474 states and 475 transitions. Second operand 118 states. [2019-09-08 01:21:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:11,022 INFO L93 Difference]: Finished difference Result 488 states and 490 transitions. [2019-09-08 01:21:11,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-08 01:21:11,022 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 472 [2019-09-08 01:21:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:11,024 INFO L225 Difference]: With dead ends: 488 [2019-09-08 01:21:11,024 INFO L226 Difference]: Without dead ends: 481 [2019-09-08 01:21:11,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 01:21:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-08 01:21:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2019-09-08 01:21:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-09-08 01:21:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 479 transitions. [2019-09-08 01:21:11,029 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 479 transitions. Word has length 472 [2019-09-08 01:21:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:11,030 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 479 transitions. [2019-09-08 01:21:11,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-08 01:21:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 479 transitions. [2019-09-08 01:21:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 01:21:11,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:11,032 INFO L399 BasicCegarLoop]: trace histogram [116, 116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:11,032 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1979835415, now seen corresponding path program 114 times [2019-09-08 01:21:11,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:11,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:11,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 26796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:15,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:15,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:16,003 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:21:17,356 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 117 check-sat command(s) [2019-09-08 01:21:17,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:17,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 4073 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-08 01:21:17,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 26796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:17,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:17,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2019-09-08 01:21:17,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-08 01:21:17,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-08 01:21:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 01:21:17,538 INFO L87 Difference]: Start difference. First operand 478 states and 479 transitions. Second operand 119 states. [2019-09-08 01:21:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:18,491 INFO L93 Difference]: Finished difference Result 492 states and 494 transitions. [2019-09-08 01:21:18,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-08 01:21:18,491 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 476 [2019-09-08 01:21:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:18,492 INFO L225 Difference]: With dead ends: 492 [2019-09-08 01:21:18,493 INFO L226 Difference]: Without dead ends: 485 [2019-09-08 01:21:18,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-09-08 01:21:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-08 01:21:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 482. [2019-09-08 01:21:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-08 01:21:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 483 transitions. [2019-09-08 01:21:18,498 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 483 transitions. Word has length 476 [2019-09-08 01:21:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:18,498 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 483 transitions. [2019-09-08 01:21:18,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-08 01:21:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 483 transitions. [2019-09-08 01:21:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-08 01:21:18,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:18,500 INFO L399 BasicCegarLoop]: trace histogram [117, 117, 117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:18,500 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:18,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:18,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1149070864, now seen corresponding path program 115 times [2019-09-08 01:21:18,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:18,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:18,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:18,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 27261 backedges. 0 proven. 27261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:23,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:23,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:23,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:21:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:24,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 4107 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-08 01:21:24,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27261 backedges. 0 proven. 27261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:24,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:24,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2019-09-08 01:21:24,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-08 01:21:24,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-08 01:21:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-08 01:21:24,411 INFO L87 Difference]: Start difference. First operand 482 states and 483 transitions. Second operand 120 states. [2019-09-08 01:21:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:25,281 INFO L93 Difference]: Finished difference Result 496 states and 498 transitions. [2019-09-08 01:21:25,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-08 01:21:25,282 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 480 [2019-09-08 01:21:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:25,283 INFO L225 Difference]: With dead ends: 496 [2019-09-08 01:21:25,283 INFO L226 Difference]: Without dead ends: 489 [2019-09-08 01:21:25,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-08 01:21:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-08 01:21:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2019-09-08 01:21:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-08 01:21:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 487 transitions. [2019-09-08 01:21:25,290 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 487 transitions. Word has length 480 [2019-09-08 01:21:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:25,291 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 487 transitions. [2019-09-08 01:21:25,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-08 01:21:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 487 transitions. [2019-09-08 01:21:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-08 01:21:25,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:25,294 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:25,294 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash 171879543, now seen corresponding path program 116 times [2019-09-08 01:21:25,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:25,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:25,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:21:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 27730 backedges. 0 proven. 27730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:30,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:30,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:30,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:21:31,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:21:31,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:31,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 4141 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-08 01:21:31,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 27730 backedges. 0 proven. 27730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:31,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:31,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2019-09-08 01:21:31,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-08 01:21:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-08 01:21:31,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 01:21:31,376 INFO L87 Difference]: Start difference. First operand 486 states and 487 transitions. Second operand 121 states. [2019-09-08 01:21:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:32,385 INFO L93 Difference]: Finished difference Result 500 states and 502 transitions. [2019-09-08 01:21:32,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-08 01:21:32,386 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 484 [2019-09-08 01:21:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:32,387 INFO L225 Difference]: With dead ends: 500 [2019-09-08 01:21:32,387 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 01:21:32,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-09-08 01:21:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 01:21:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2019-09-08 01:21:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-08 01:21:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 491 transitions. [2019-09-08 01:21:32,394 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 491 transitions. Word has length 484 [2019-09-08 01:21:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:32,395 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 491 transitions. [2019-09-08 01:21:32,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-08 01:21:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 491 transitions. [2019-09-08 01:21:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-08 01:21:32,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:32,398 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:32,398 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:32,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash 281815934, now seen corresponding path program 117 times [2019-09-08 01:21:32,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:32,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:32,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:32,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:32,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 28203 backedges. 0 proven. 28203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:37,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:37,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:37,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:21:39,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 120 check-sat command(s) [2019-09-08 01:21:39,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:39,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 4175 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-08 01:21:39,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 28203 backedges. 0 proven. 28203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:39,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:39,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2019-09-08 01:21:39,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-08 01:21:39,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-08 01:21:39,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-08 01:21:39,352 INFO L87 Difference]: Start difference. First operand 490 states and 491 transitions. Second operand 122 states. [2019-09-08 01:21:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:40,169 INFO L93 Difference]: Finished difference Result 504 states and 506 transitions. [2019-09-08 01:21:40,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-08 01:21:40,169 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 488 [2019-09-08 01:21:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:40,170 INFO L225 Difference]: With dead ends: 504 [2019-09-08 01:21:40,170 INFO L226 Difference]: Without dead ends: 497 [2019-09-08 01:21:40,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-08 01:21:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-08 01:21:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 494. [2019-09-08 01:21:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-08 01:21:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 495 transitions. [2019-09-08 01:21:40,176 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 495 transitions. Word has length 488 [2019-09-08 01:21:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:40,177 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 495 transitions. [2019-09-08 01:21:40,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-08 01:21:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 495 transitions. [2019-09-08 01:21:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-08 01:21:40,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:40,179 INFO L399 BasicCegarLoop]: trace histogram [120, 120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:40,179 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:40,179 INFO L82 PathProgramCache]: Analyzing trace with hash 115658501, now seen corresponding path program 118 times [2019-09-08 01:21:40,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:40,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:40,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:40,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:40,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 28680 backedges. 0 proven. 28680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:45,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:45,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:45,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:21:46,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:21:46,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:46,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 4209 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-08 01:21:46,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28680 backedges. 0 proven. 28680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:46,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:46,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2019-09-08 01:21:46,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-08 01:21:46,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-08 01:21:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-08 01:21:46,454 INFO L87 Difference]: Start difference. First operand 494 states and 495 transitions. Second operand 123 states. [2019-09-08 01:21:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:47,391 INFO L93 Difference]: Finished difference Result 508 states and 510 transitions. [2019-09-08 01:21:47,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-08 01:21:47,391 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 492 [2019-09-08 01:21:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:47,392 INFO L225 Difference]: With dead ends: 508 [2019-09-08 01:21:47,393 INFO L226 Difference]: Without dead ends: 501 [2019-09-08 01:21:47,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-09-08 01:21:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-08 01:21:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 498. [2019-09-08 01:21:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-08 01:21:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 499 transitions. [2019-09-08 01:21:47,398 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 499 transitions. Word has length 492 [2019-09-08 01:21:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:47,398 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 499 transitions. [2019-09-08 01:21:47,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-08 01:21:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 499 transitions. [2019-09-08 01:21:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 01:21:47,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:47,400 INFO L399 BasicCegarLoop]: trace histogram [121, 121, 121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:47,400 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:47,400 INFO L82 PathProgramCache]: Analyzing trace with hash 828528396, now seen corresponding path program 119 times [2019-09-08 01:21:47,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:47,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:47,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:21:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 29161 backedges. 0 proven. 29161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:52,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:21:52,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:21:52,749 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:21:54,215 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 122 check-sat command(s) [2019-09-08 01:21:54,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:21:54,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 4243 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-08 01:21:54,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:21:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29161 backedges. 0 proven. 29161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:21:54,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:21:54,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2019-09-08 01:21:54,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-08 01:21:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-08 01:21:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 01:21:54,429 INFO L87 Difference]: Start difference. First operand 498 states and 499 transitions. Second operand 124 states. [2019-09-08 01:21:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:21:55,455 INFO L93 Difference]: Finished difference Result 512 states and 514 transitions. [2019-09-08 01:21:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-08 01:21:55,455 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 496 [2019-09-08 01:21:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:21:55,457 INFO L225 Difference]: With dead ends: 512 [2019-09-08 01:21:55,457 INFO L226 Difference]: Without dead ends: 505 [2019-09-08 01:21:55,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-08 01:21:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-08 01:21:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2019-09-08 01:21:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 01:21:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 503 transitions. [2019-09-08 01:21:55,465 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 503 transitions. Word has length 496 [2019-09-08 01:21:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:21:55,465 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 503 transitions. [2019-09-08 01:21:55,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-08 01:21:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 503 transitions. [2019-09-08 01:21:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-08 01:21:55,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:21:55,468 INFO L399 BasicCegarLoop]: trace histogram [122, 122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:21:55,468 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:21:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:21:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1379828627, now seen corresponding path program 120 times [2019-09-08 01:21:55,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:21:55,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:21:55,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:55,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:21:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:21:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 29646 backedges. 0 proven. 29646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:01,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:01,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:01,147 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:22:02,641 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 123 check-sat command(s) [2019-09-08 01:22:02,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:02,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 4277 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-08 01:22:02,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 29646 backedges. 0 proven. 29646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:02,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:02,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2019-09-08 01:22:02,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-08 01:22:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-08 01:22:02,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 01:22:02,845 INFO L87 Difference]: Start difference. First operand 502 states and 503 transitions. Second operand 125 states. [2019-09-08 01:22:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:03,657 INFO L93 Difference]: Finished difference Result 516 states and 518 transitions. [2019-09-08 01:22:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-08 01:22:03,657 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 500 [2019-09-08 01:22:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:03,658 INFO L225 Difference]: With dead ends: 516 [2019-09-08 01:22:03,658 INFO L226 Difference]: Without dead ends: 509 [2019-09-08 01:22:03,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-09-08 01:22:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-08 01:22:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 506. [2019-09-08 01:22:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-08 01:22:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 507 transitions. [2019-09-08 01:22:03,663 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 507 transitions. Word has length 500 [2019-09-08 01:22:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:03,664 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 507 transitions. [2019-09-08 01:22:03,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-08 01:22:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 507 transitions. [2019-09-08 01:22:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-08 01:22:03,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:03,666 INFO L399 BasicCegarLoop]: trace histogram [123, 123, 123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:03,666 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash 412292250, now seen corresponding path program 121 times [2019-09-08 01:22:03,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:03,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:03,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30135 backedges. 0 proven. 30135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:09,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:09,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:09,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:09,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 4311 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-08 01:22:09,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30135 backedges. 0 proven. 30135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:10,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:10,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2019-09-08 01:22:10,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-08 01:22:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-08 01:22:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 01:22:10,007 INFO L87 Difference]: Start difference. First operand 506 states and 507 transitions. Second operand 126 states. [2019-09-08 01:22:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:10,917 INFO L93 Difference]: Finished difference Result 520 states and 522 transitions. [2019-09-08 01:22:10,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-08 01:22:10,918 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 504 [2019-09-08 01:22:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:10,920 INFO L225 Difference]: With dead ends: 520 [2019-09-08 01:22:10,920 INFO L226 Difference]: Without dead ends: 513 [2019-09-08 01:22:10,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 01:22:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-08 01:22:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-09-08 01:22:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-09-08 01:22:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 511 transitions. [2019-09-08 01:22:10,927 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 511 transitions. Word has length 504 [2019-09-08 01:22:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:10,927 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 511 transitions. [2019-09-08 01:22:10,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-08 01:22:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 511 transitions. [2019-09-08 01:22:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-08 01:22:10,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:10,930 INFO L399 BasicCegarLoop]: trace histogram [124, 124, 124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:10,930 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1868969439, now seen corresponding path program 122 times [2019-09-08 01:22:10,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:10,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:10,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:10,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30628 backedges. 0 proven. 30628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:16,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:16,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:16,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:22:17,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:22:17,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:17,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 4345 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-08 01:22:17,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30628 backedges. 0 proven. 30628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:17,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:17,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2019-09-08 01:22:17,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-08 01:22:17,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-08 01:22:17,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 01:22:17,503 INFO L87 Difference]: Start difference. First operand 510 states and 511 transitions. Second operand 127 states. [2019-09-08 01:22:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:18,641 INFO L93 Difference]: Finished difference Result 524 states and 526 transitions. [2019-09-08 01:22:18,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-08 01:22:18,642 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 508 [2019-09-08 01:22:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:18,643 INFO L225 Difference]: With dead ends: 524 [2019-09-08 01:22:18,643 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 01:22:18,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-09-08 01:22:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 01:22:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 514. [2019-09-08 01:22:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-08 01:22:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 515 transitions. [2019-09-08 01:22:18,651 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 515 transitions. Word has length 508 [2019-09-08 01:22:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:18,651 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 515 transitions. [2019-09-08 01:22:18,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-08 01:22:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 515 transitions. [2019-09-08 01:22:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-09-08 01:22:18,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:18,654 INFO L399 BasicCegarLoop]: trace histogram [125, 125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:18,655 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1817418712, now seen corresponding path program 123 times [2019-09-08 01:22:18,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:18,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:18,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 31125 backedges. 0 proven. 31125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:24,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:24,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:24,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:22:26,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 126 check-sat command(s) [2019-09-08 01:22:26,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:26,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 4379 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-08 01:22:26,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 31125 backedges. 0 proven. 31125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:26,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:26,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2019-09-08 01:22:26,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-08 01:22:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-08 01:22:26,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 01:22:26,291 INFO L87 Difference]: Start difference. First operand 514 states and 515 transitions. Second operand 128 states. [2019-09-08 01:22:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:27,497 INFO L93 Difference]: Finished difference Result 528 states and 530 transitions. [2019-09-08 01:22:27,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-08 01:22:27,497 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 512 [2019-09-08 01:22:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:27,499 INFO L225 Difference]: With dead ends: 528 [2019-09-08 01:22:27,499 INFO L226 Difference]: Without dead ends: 521 [2019-09-08 01:22:27,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-08 01:22:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-09-08 01:22:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 518. [2019-09-08 01:22:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-08 01:22:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 519 transitions. [2019-09-08 01:22:27,507 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 519 transitions. Word has length 512 [2019-09-08 01:22:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:27,508 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 519 transitions. [2019-09-08 01:22:27,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-08 01:22:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 519 transitions. [2019-09-08 01:22:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-08 01:22:27,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:27,511 INFO L399 BasicCegarLoop]: trace histogram [126, 126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:27,512 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash 944022191, now seen corresponding path program 124 times [2019-09-08 01:22:27,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:27,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:27,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 31626 backedges. 0 proven. 31626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:33,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:33,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:33,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:22:34,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:22:34,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:34,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 4413 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-08 01:22:34,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 31626 backedges. 0 proven. 31626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:34,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2019-09-08 01:22:34,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-08 01:22:34,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-08 01:22:34,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 01:22:34,307 INFO L87 Difference]: Start difference. First operand 518 states and 519 transitions. Second operand 129 states. [2019-09-08 01:22:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:35,557 INFO L93 Difference]: Finished difference Result 532 states and 534 transitions. [2019-09-08 01:22:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-08 01:22:35,558 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 516 [2019-09-08 01:22:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:35,559 INFO L225 Difference]: With dead ends: 532 [2019-09-08 01:22:35,559 INFO L226 Difference]: Without dead ends: 525 [2019-09-08 01:22:35,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-09-08 01:22:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-08 01:22:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 522. [2019-09-08 01:22:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-09-08 01:22:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 523 transitions. [2019-09-08 01:22:35,566 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 523 transitions. Word has length 516 [2019-09-08 01:22:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:35,567 INFO L475 AbstractCegarLoop]: Abstraction has 522 states and 523 transitions. [2019-09-08 01:22:35,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-08 01:22:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 523 transitions. [2019-09-08 01:22:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2019-09-08 01:22:35,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:35,569 INFO L399 BasicCegarLoop]: trace histogram [127, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:35,570 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1107051958, now seen corresponding path program 125 times [2019-09-08 01:22:35,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:35,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:35,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:35,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:35,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 32131 backedges. 0 proven. 32131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:41,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:41,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:41,448 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:22:42,978 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 128 check-sat command(s) [2019-09-08 01:22:42,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:42,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 4447 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-08 01:22:42,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32131 backedges. 0 proven. 32131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:43,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:43,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 130 [2019-09-08 01:22:43,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-08 01:22:43,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-08 01:22:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-08 01:22:43,168 INFO L87 Difference]: Start difference. First operand 522 states and 523 transitions. Second operand 130 states. [2019-09-08 01:22:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:44,003 INFO L93 Difference]: Finished difference Result 536 states and 538 transitions. [2019-09-08 01:22:44,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-08 01:22:44,003 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 520 [2019-09-08 01:22:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:44,004 INFO L225 Difference]: With dead ends: 536 [2019-09-08 01:22:44,004 INFO L226 Difference]: Without dead ends: 529 [2019-09-08 01:22:44,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-08 01:22:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-08 01:22:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 526. [2019-09-08 01:22:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-08 01:22:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 527 transitions. [2019-09-08 01:22:44,011 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 527 transitions. Word has length 520 [2019-09-08 01:22:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:44,011 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 527 transitions. [2019-09-08 01:22:44,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-08 01:22:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 527 transitions. [2019-09-08 01:22:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-08 01:22:44,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:44,014 INFO L399 BasicCegarLoop]: trace histogram [128, 128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:44,014 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1853027011, now seen corresponding path program 126 times [2019-09-08 01:22:44,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:44,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:44,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:44,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 32640 backedges. 0 proven. 32640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:49,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:49,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:50,010 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:22:51,585 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 129 check-sat command(s) [2019-09-08 01:22:51,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:22:51,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 4481 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-08 01:22:51,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32640 backedges. 0 proven. 32640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:52,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:52,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2019-09-08 01:22:52,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-08 01:22:52,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-08 01:22:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-08 01:22:52,080 INFO L87 Difference]: Start difference. First operand 526 states and 527 transitions. Second operand 131 states. [2019-09-08 01:22:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:22:52,846 INFO L93 Difference]: Finished difference Result 540 states and 542 transitions. [2019-09-08 01:22:52,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-08 01:22:52,847 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 524 [2019-09-08 01:22:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:22:52,848 INFO L225 Difference]: With dead ends: 540 [2019-09-08 01:22:52,848 INFO L226 Difference]: Without dead ends: 533 [2019-09-08 01:22:52,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-09-08 01:22:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-08 01:22:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 530. [2019-09-08 01:22:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-09-08 01:22:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 531 transitions. [2019-09-08 01:22:52,855 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 531 transitions. Word has length 524 [2019-09-08 01:22:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:22:52,855 INFO L475 AbstractCegarLoop]: Abstraction has 530 states and 531 transitions. [2019-09-08 01:22:52,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-08 01:22:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 531 transitions. [2019-09-08 01:22:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-09-08 01:22:52,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:22:52,857 INFO L399 BasicCegarLoop]: trace histogram [129, 129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:22:52,857 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:22:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:22:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1798260412, now seen corresponding path program 127 times [2019-09-08 01:22:52,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:22:52,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:22:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:52,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:22:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:22:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 33153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:59,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:22:59,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:22:59,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:22:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:22:59,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 4515 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-08 01:22:59,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:22:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 33153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:22:59,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:22:59,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2019-09-08 01:22:59,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-08 01:22:59,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-08 01:22:59,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 01:22:59,898 INFO L87 Difference]: Start difference. First operand 530 states and 531 transitions. Second operand 132 states. [2019-09-08 01:23:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:01,092 INFO L93 Difference]: Finished difference Result 544 states and 546 transitions. [2019-09-08 01:23:01,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-08 01:23:01,093 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 528 [2019-09-08 01:23:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:01,094 INFO L225 Difference]: With dead ends: 544 [2019-09-08 01:23:01,094 INFO L226 Difference]: Without dead ends: 537 [2019-09-08 01:23:01,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 01:23:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-08 01:23:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 534. [2019-09-08 01:23:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-09-08 01:23:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 535 transitions. [2019-09-08 01:23:01,102 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 535 transitions. Word has length 528 [2019-09-08 01:23:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:01,102 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 535 transitions. [2019-09-08 01:23:01,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-08 01:23:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 535 transitions. [2019-09-08 01:23:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-09-08 01:23:01,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:01,106 INFO L399 BasicCegarLoop]: trace histogram [130, 130, 130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:01,106 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:01,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1228863029, now seen corresponding path program 128 times [2019-09-08 01:23:01,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:01,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:01,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:23:01,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 33670 backedges. 0 proven. 33670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:07,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:07,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:07,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:23:08,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:23:08,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:08,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 4549 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-08 01:23:08,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 33670 backedges. 0 proven. 33670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:08,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:08,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2019-09-08 01:23:08,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-08 01:23:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-08 01:23:08,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-08 01:23:08,253 INFO L87 Difference]: Start difference. First operand 534 states and 535 transitions. Second operand 133 states. [2019-09-08 01:23:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:09,458 INFO L93 Difference]: Finished difference Result 548 states and 550 transitions. [2019-09-08 01:23:09,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-08 01:23:09,459 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 532 [2019-09-08 01:23:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:09,460 INFO L225 Difference]: With dead ends: 548 [2019-09-08 01:23:09,460 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 01:23:09,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-09-08 01:23:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 01:23:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 538. [2019-09-08 01:23:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-09-08 01:23:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 539 transitions. [2019-09-08 01:23:09,466 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 539 transitions. Word has length 532 [2019-09-08 01:23:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:09,466 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 539 transitions. [2019-09-08 01:23:09,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-08 01:23:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 539 transitions. [2019-09-08 01:23:09,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-09-08 01:23:09,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:09,468 INFO L399 BasicCegarLoop]: trace histogram [131, 131, 131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:09,469 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:09,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:09,469 INFO L82 PathProgramCache]: Analyzing trace with hash -814235950, now seen corresponding path program 129 times [2019-09-08 01:23:09,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:09,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:09,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:09,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:09,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 34191 backedges. 0 proven. 34191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:15,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:15,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:15,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:23:17,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2019-09-08 01:23:17,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:17,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 4583 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-08 01:23:17,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 34191 backedges. 0 proven. 34191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:17,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:17,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2019-09-08 01:23:17,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-08 01:23:17,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-08 01:23:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 01:23:17,784 INFO L87 Difference]: Start difference. First operand 538 states and 539 transitions. Second operand 134 states. [2019-09-08 01:23:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:18,612 INFO L93 Difference]: Finished difference Result 552 states and 554 transitions. [2019-09-08 01:23:18,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-08 01:23:18,612 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 536 [2019-09-08 01:23:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:18,613 INFO L225 Difference]: With dead ends: 552 [2019-09-08 01:23:18,613 INFO L226 Difference]: Without dead ends: 545 [2019-09-08 01:23:18,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-08 01:23:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-08 01:23:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 542. [2019-09-08 01:23:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-08 01:23:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 543 transitions. [2019-09-08 01:23:18,619 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 543 transitions. Word has length 536 [2019-09-08 01:23:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:18,620 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 543 transitions. [2019-09-08 01:23:18,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-08 01:23:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 543 transitions. [2019-09-08 01:23:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-09-08 01:23:18,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:18,622 INFO L399 BasicCegarLoop]: trace histogram [132, 132, 132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:18,622 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1808885671, now seen corresponding path program 130 times [2019-09-08 01:23:18,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:18,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:18,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:18,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:18,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 34716 backedges. 0 proven. 34716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:25,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:25,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:25,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:23:25,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:23:25,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:25,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 4617 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-08 01:23:25,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 34716 backedges. 0 proven. 34716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:25,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:25,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2019-09-08 01:23:25,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-08 01:23:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-08 01:23:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 01:23:25,919 INFO L87 Difference]: Start difference. First operand 542 states and 543 transitions. Second operand 135 states. [2019-09-08 01:23:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:26,917 INFO L93 Difference]: Finished difference Result 556 states and 558 transitions. [2019-09-08 01:23:26,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-08 01:23:26,918 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 540 [2019-09-08 01:23:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:26,919 INFO L225 Difference]: With dead ends: 556 [2019-09-08 01:23:26,919 INFO L226 Difference]: Without dead ends: 549 [2019-09-08 01:23:26,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-09-08 01:23:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-08 01:23:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 546. [2019-09-08 01:23:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-08 01:23:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 547 transitions. [2019-09-08 01:23:26,926 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 547 transitions. Word has length 540 [2019-09-08 01:23:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:26,926 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 547 transitions. [2019-09-08 01:23:26,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-08 01:23:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 547 transitions. [2019-09-08 01:23:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2019-09-08 01:23:26,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:26,928 INFO L399 BasicCegarLoop]: trace histogram [133, 133, 133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:26,929 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash 121591392, now seen corresponding path program 131 times [2019-09-08 01:23:26,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:26,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:26,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:26,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:26,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 35245 backedges. 0 proven. 35245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:33,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:33,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:33,498 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:23:35,165 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 134 check-sat command(s) [2019-09-08 01:23:35,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:35,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 4651 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-08 01:23:35,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 35245 backedges. 0 proven. 35245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:35,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:35,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 136 [2019-09-08 01:23:35,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-08 01:23:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-08 01:23:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 01:23:35,368 INFO L87 Difference]: Start difference. First operand 546 states and 547 transitions. Second operand 136 states. [2019-09-08 01:23:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:36,838 INFO L93 Difference]: Finished difference Result 560 states and 562 transitions. [2019-09-08 01:23:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-08 01:23:36,839 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 544 [2019-09-08 01:23:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:36,840 INFO L225 Difference]: With dead ends: 560 [2019-09-08 01:23:36,840 INFO L226 Difference]: Without dead ends: 553 [2019-09-08 01:23:36,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-08 01:23:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-09-08 01:23:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2019-09-08 01:23:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-08 01:23:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 551 transitions. [2019-09-08 01:23:36,846 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 551 transitions. Word has length 544 [2019-09-08 01:23:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:36,846 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 551 transitions. [2019-09-08 01:23:36,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-08 01:23:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 551 transitions. [2019-09-08 01:23:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-08 01:23:36,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:36,848 INFO L399 BasicCegarLoop]: trace histogram [134, 134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:36,849 INFO L418 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash -400312089, now seen corresponding path program 132 times [2019-09-08 01:23:36,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:36,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:36,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 35778 backedges. 0 proven. 35778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:43,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:43,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:43,560 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:23:45,255 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 135 check-sat command(s) [2019-09-08 01:23:45,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:23:45,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 4685 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-08 01:23:45,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 35778 backedges. 0 proven. 35778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:45,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:45,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2019-09-08 01:23:45,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-08 01:23:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-08 01:23:45,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 01:23:45,499 INFO L87 Difference]: Start difference. First operand 550 states and 551 transitions. Second operand 137 states. [2019-09-08 01:23:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:46,995 INFO L93 Difference]: Finished difference Result 564 states and 566 transitions. [2019-09-08 01:23:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-08 01:23:46,996 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 548 [2019-09-08 01:23:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:46,997 INFO L225 Difference]: With dead ends: 564 [2019-09-08 01:23:46,997 INFO L226 Difference]: Without dead ends: 557 [2019-09-08 01:23:46,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-09-08 01:23:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-08 01:23:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 554. [2019-09-08 01:23:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-08 01:23:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2019-09-08 01:23:47,006 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 548 [2019-09-08 01:23:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:47,007 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2019-09-08 01:23:47,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-08 01:23:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2019-09-08 01:23:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2019-09-08 01:23:47,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:47,010 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:47,011 INFO L418 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:47,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 594903022, now seen corresponding path program 133 times [2019-09-08 01:23:47,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:47,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:47,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:23:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36315 backedges. 0 proven. 36315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:53,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:23:53,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:23:53,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:23:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:23:54,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 4719 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-08 01:23:54,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:23:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 36315 backedges. 0 proven. 36315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:23:54,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:23:54,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 138 [2019-09-08 01:23:54,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-08 01:23:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-08 01:23:54,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 01:23:54,721 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 138 states. [2019-09-08 01:23:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:23:56,029 INFO L93 Difference]: Finished difference Result 568 states and 570 transitions. [2019-09-08 01:23:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-08 01:23:56,029 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 552 [2019-09-08 01:23:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:23:56,030 INFO L225 Difference]: With dead ends: 568 [2019-09-08 01:23:56,030 INFO L226 Difference]: Without dead ends: 561 [2019-09-08 01:23:56,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 01:23:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-08 01:23:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 558. [2019-09-08 01:23:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 01:23:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 559 transitions. [2019-09-08 01:23:56,035 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 559 transitions. Word has length 552 [2019-09-08 01:23:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:23:56,036 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 559 transitions. [2019-09-08 01:23:56,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-08 01:23:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 559 transitions. [2019-09-08 01:23:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-08 01:23:56,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:23:56,039 INFO L399 BasicCegarLoop]: trace histogram [136, 136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:23:56,039 INFO L418 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:23:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:23:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1122921333, now seen corresponding path program 134 times [2019-09-08 01:23:56,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:23:56,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:23:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:56,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:23:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:23:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36856 backedges. 0 proven. 36856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:02,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:02,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:24:02,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:24:03,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:24:03,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:24:03,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 4753 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-08 01:24:03,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36856 backedges. 0 proven. 36856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:03,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:03,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2019-09-08 01:24:03,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-08 01:24:03,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-08 01:24:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 01:24:03,691 INFO L87 Difference]: Start difference. First operand 558 states and 559 transitions. Second operand 139 states. [2019-09-08 01:24:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:04,724 INFO L93 Difference]: Finished difference Result 572 states and 574 transitions. [2019-09-08 01:24:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-08 01:24:04,725 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 556 [2019-09-08 01:24:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:04,726 INFO L225 Difference]: With dead ends: 572 [2019-09-08 01:24:04,726 INFO L226 Difference]: Without dead ends: 565 [2019-09-08 01:24:04,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-09-08 01:24:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-08 01:24:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 562. [2019-09-08 01:24:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 01:24:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 563 transitions. [2019-09-08 01:24:04,733 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 563 transitions. Word has length 556 [2019-09-08 01:24:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:04,734 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 563 transitions. [2019-09-08 01:24:04,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-08 01:24:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 563 transitions. [2019-09-08 01:24:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2019-09-08 01:24:04,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:04,736 INFO L399 BasicCegarLoop]: trace histogram [137, 137, 137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:04,736 INFO L418 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash -580371588, now seen corresponding path program 135 times [2019-09-08 01:24:04,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:04,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 37401 backedges. 0 proven. 37401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:11,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:11,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:24:11,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:24:13,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 138 check-sat command(s) [2019-09-08 01:24:13,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:24:13,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 4787 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-08 01:24:13,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 37401 backedges. 0 proven. 37401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:13,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:13,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2019-09-08 01:24:13,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-08 01:24:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-08 01:24:13,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-08 01:24:13,485 INFO L87 Difference]: Start difference. First operand 562 states and 563 transitions. Second operand 140 states. [2019-09-08 01:24:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:14,861 INFO L93 Difference]: Finished difference Result 576 states and 578 transitions. [2019-09-08 01:24:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-08 01:24:14,861 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 560 [2019-09-08 01:24:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:14,862 INFO L225 Difference]: With dead ends: 576 [2019-09-08 01:24:14,863 INFO L226 Difference]: Without dead ends: 569 [2019-09-08 01:24:14,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-08 01:24:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-08 01:24:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2019-09-08 01:24:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-08 01:24:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 567 transitions. [2019-09-08 01:24:14,869 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 567 transitions. Word has length 560 [2019-09-08 01:24:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:14,869 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 567 transitions. [2019-09-08 01:24:14,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-08 01:24:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 567 transitions. [2019-09-08 01:24:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-09-08 01:24:14,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:14,871 INFO L399 BasicCegarLoop]: trace histogram [138, 138, 138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:14,872 INFO L418 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash 115126275, now seen corresponding path program 136 times [2019-09-08 01:24:14,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:14,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:14,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:14,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:14,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 37950 backedges. 0 proven. 37950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:21,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:21,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:24:21,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:24:22,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:24:22,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:24:22,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 4821 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-08 01:24:22,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 37950 backedges. 0 proven. 37950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:22,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:22,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2019-09-08 01:24:22,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-08 01:24:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-08 01:24:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 01:24:22,766 INFO L87 Difference]: Start difference. First operand 566 states and 567 transitions. Second operand 141 states. [2019-09-08 01:24:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:24,277 INFO L93 Difference]: Finished difference Result 580 states and 582 transitions. [2019-09-08 01:24:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-08 01:24:24,278 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 564 [2019-09-08 01:24:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:24,279 INFO L225 Difference]: With dead ends: 580 [2019-09-08 01:24:24,279 INFO L226 Difference]: Without dead ends: 573 [2019-09-08 01:24:24,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-09-08 01:24:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-08 01:24:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 570. [2019-09-08 01:24:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-09-08 01:24:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 571 transitions. [2019-09-08 01:24:24,285 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 571 transitions. Word has length 564 [2019-09-08 01:24:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:24,285 INFO L475 AbstractCegarLoop]: Abstraction has 570 states and 571 transitions. [2019-09-08 01:24:24,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-08 01:24:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 571 transitions. [2019-09-08 01:24:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-09-08 01:24:24,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:24,288 INFO L399 BasicCegarLoop]: trace histogram [139, 139, 139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:24,288 INFO L418 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:24,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1067087606, now seen corresponding path program 137 times [2019-09-08 01:24:24,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:24,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:24,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:24,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:24,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 38503 backedges. 0 proven. 38503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:31,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:31,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:24:31,530 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:24:33,350 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 140 check-sat command(s) [2019-09-08 01:24:33,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:24:33,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 4855 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-08 01:24:33,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 38503 backedges. 0 proven. 38503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:33,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:33,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 142 [2019-09-08 01:24:33,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-08 01:24:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-08 01:24:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-08 01:24:33,569 INFO L87 Difference]: Start difference. First operand 570 states and 571 transitions. Second operand 142 states. [2019-09-08 01:24:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:34,889 INFO L93 Difference]: Finished difference Result 584 states and 586 transitions. [2019-09-08 01:24:34,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-08 01:24:34,889 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 568 [2019-09-08 01:24:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:34,890 INFO L225 Difference]: With dead ends: 584 [2019-09-08 01:24:34,890 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 01:24:34,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-08 01:24:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 01:24:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-09-08 01:24:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-08 01:24:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2019-09-08 01:24:34,899 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 568 [2019-09-08 01:24:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:34,900 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2019-09-08 01:24:34,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-08 01:24:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2019-09-08 01:24:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-09-08 01:24:34,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:34,904 INFO L399 BasicCegarLoop]: trace histogram [140, 140, 140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:34,904 INFO L418 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1748797073, now seen corresponding path program 138 times [2019-09-08 01:24:34,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:34,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:34,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:34,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 39060 backedges. 0 proven. 39060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:42,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:42,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:24:42,168 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:24:44,086 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 141 check-sat command(s) [2019-09-08 01:24:44,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:24:44,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 4889 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-08 01:24:44,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 39060 backedges. 0 proven. 39060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:44,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:44,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2019-09-08 01:24:44,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-08 01:24:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-08 01:24:44,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 01:24:44,312 INFO L87 Difference]: Start difference. First operand 574 states and 575 transitions. Second operand 143 states. [2019-09-08 01:24:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:45,681 INFO L93 Difference]: Finished difference Result 588 states and 590 transitions. [2019-09-08 01:24:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-08 01:24:45,681 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 572 [2019-09-08 01:24:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:45,683 INFO L225 Difference]: With dead ends: 588 [2019-09-08 01:24:45,683 INFO L226 Difference]: Without dead ends: 581 [2019-09-08 01:24:45,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 573 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-09-08 01:24:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-08 01:24:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 578. [2019-09-08 01:24:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-08 01:24:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 579 transitions. [2019-09-08 01:24:45,725 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 579 transitions. Word has length 572 [2019-09-08 01:24:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:45,725 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 579 transitions. [2019-09-08 01:24:45,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-08 01:24:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 579 transitions. [2019-09-08 01:24:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-09-08 01:24:45,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:45,729 INFO L399 BasicCegarLoop]: trace histogram [141, 141, 141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:45,729 INFO L418 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash 700147864, now seen corresponding path program 139 times [2019-09-08 01:24:45,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:45,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:45,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:24:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 39621 backedges. 0 proven. 39621 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:53,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:24:53,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:24:53,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:24:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:24:53,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 4923 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-08 01:24:53,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:24:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 39621 backedges. 0 proven. 39621 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:24:54,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:24:54,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 144 [2019-09-08 01:24:54,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-08 01:24:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-08 01:24:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-08 01:24:54,093 INFO L87 Difference]: Start difference. First operand 578 states and 579 transitions. Second operand 144 states. [2019-09-08 01:24:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:24:55,814 INFO L93 Difference]: Finished difference Result 592 states and 594 transitions. [2019-09-08 01:24:55,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-08 01:24:55,814 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 576 [2019-09-08 01:24:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:24:55,815 INFO L225 Difference]: With dead ends: 592 [2019-09-08 01:24:55,815 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 01:24:55,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-08 01:24:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 01:24:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2019-09-08 01:24:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 01:24:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 583 transitions. [2019-09-08 01:24:55,821 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 583 transitions. Word has length 576 [2019-09-08 01:24:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:24:55,822 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 583 transitions. [2019-09-08 01:24:55,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-08 01:24:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 583 transitions. [2019-09-08 01:24:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-09-08 01:24:55,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:24:55,824 INFO L399 BasicCegarLoop]: trace histogram [142, 142, 142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:24:55,825 INFO L418 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:24:55,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:24:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1834741535, now seen corresponding path program 140 times [2019-09-08 01:24:55,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:24:55,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:24:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:55,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:24:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:24:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 40186 backedges. 0 proven. 40186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:03,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:03,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:03,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:25:04,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:25:04,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:04,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 4957 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-08 01:25:04,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 40186 backedges. 0 proven. 40186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:04,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:04,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2019-09-08 01:25:04,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-08 01:25:04,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-08 01:25:04,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 01:25:04,288 INFO L87 Difference]: Start difference. First operand 582 states and 583 transitions. Second operand 145 states. [2019-09-08 01:25:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:05,956 INFO L93 Difference]: Finished difference Result 596 states and 598 transitions. [2019-09-08 01:25:05,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 01:25:05,956 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 580 [2019-09-08 01:25:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:05,957 INFO L225 Difference]: With dead ends: 596 [2019-09-08 01:25:05,957 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 01:25:05,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-09-08 01:25:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 01:25:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 586. [2019-09-08 01:25:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-08 01:25:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 587 transitions. [2019-09-08 01:25:05,963 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 587 transitions. Word has length 580 [2019-09-08 01:25:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:05,963 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 587 transitions. [2019-09-08 01:25:05,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-08 01:25:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 587 transitions. [2019-09-08 01:25:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-09-08 01:25:05,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:05,966 INFO L399 BasicCegarLoop]: trace histogram [143, 143, 143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:05,966 INFO L418 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1220008486, now seen corresponding path program 141 times [2019-09-08 01:25:05,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:05,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:05,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:25:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 40755 backedges. 0 proven. 40755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:13,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:13,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:13,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:25:15,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 144 check-sat command(s) [2019-09-08 01:25:15,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:15,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 4991 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-08 01:25:15,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 40755 backedges. 0 proven. 40755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:15,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:15,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2019-09-08 01:25:15,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-08 01:25:15,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-08 01:25:15,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 01:25:15,887 INFO L87 Difference]: Start difference. First operand 586 states and 587 transitions. Second operand 146 states. [2019-09-08 01:25:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:17,587 INFO L93 Difference]: Finished difference Result 600 states and 602 transitions. [2019-09-08 01:25:17,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-08 01:25:17,588 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 584 [2019-09-08 01:25:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:17,589 INFO L225 Difference]: With dead ends: 600 [2019-09-08 01:25:17,589 INFO L226 Difference]: Without dead ends: 593 [2019-09-08 01:25:17,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-08 01:25:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-08 01:25:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2019-09-08 01:25:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 01:25:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 591 transitions. [2019-09-08 01:25:17,596 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 591 transitions. Word has length 584 [2019-09-08 01:25:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:17,596 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 591 transitions. [2019-09-08 01:25:17,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-08 01:25:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 591 transitions. [2019-09-08 01:25:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2019-09-08 01:25:17,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:17,599 INFO L399 BasicCegarLoop]: trace histogram [144, 144, 144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:17,599 INFO L418 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash -293017171, now seen corresponding path program 142 times [2019-09-08 01:25:17,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:17,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:17,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:17,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:25:17,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 41328 backedges. 0 proven. 41328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:25,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:25,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:25,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:25:25,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:25:25,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:25,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 5025 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-08 01:25:25,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 41328 backedges. 0 proven. 41328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:26,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:26,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2019-09-08 01:25:26,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-08 01:25:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-08 01:25:26,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 01:25:26,157 INFO L87 Difference]: Start difference. First operand 590 states and 591 transitions. Second operand 147 states. [2019-09-08 01:25:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:27,304 INFO L93 Difference]: Finished difference Result 604 states and 606 transitions. [2019-09-08 01:25:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-08 01:25:27,304 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 588 [2019-09-08 01:25:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:27,305 INFO L225 Difference]: With dead ends: 604 [2019-09-08 01:25:27,305 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 01:25:27,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-09-08 01:25:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 01:25:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 594. [2019-09-08 01:25:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-09-08 01:25:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 595 transitions. [2019-09-08 01:25:27,312 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 595 transitions. Word has length 588 [2019-09-08 01:25:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:27,312 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 595 transitions. [2019-09-08 01:25:27,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-08 01:25:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 595 transitions. [2019-09-08 01:25:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2019-09-08 01:25:27,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:27,315 INFO L399 BasicCegarLoop]: trace histogram [145, 145, 145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:27,315 INFO L418 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash 514383284, now seen corresponding path program 143 times [2019-09-08 01:25:27,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:27,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:27,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:25:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 41905 backedges. 0 proven. 41905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:35,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:35,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 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:35,171 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:25:37,179 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 146 check-sat command(s) [2019-09-08 01:25:37,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:37,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 5059 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-08 01:25:37,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 41905 backedges. 0 proven. 41905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:37,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:37,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 148 [2019-09-08 01:25:37,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-08 01:25:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-08 01:25:37,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-08 01:25:37,427 INFO L87 Difference]: Start difference. First operand 594 states and 595 transitions. Second operand 148 states. [2019-09-08 01:25:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:39,233 INFO L93 Difference]: Finished difference Result 608 states and 610 transitions. [2019-09-08 01:25:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-08 01:25:39,233 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 592 [2019-09-08 01:25:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:39,234 INFO L225 Difference]: With dead ends: 608 [2019-09-08 01:25:39,234 INFO L226 Difference]: Without dead ends: 601 [2019-09-08 01:25:39,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-08 01:25:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-08 01:25:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2019-09-08 01:25:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 01:25:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 599 transitions. [2019-09-08 01:25:39,240 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 599 transitions. Word has length 592 [2019-09-08 01:25:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:39,240 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 599 transitions. [2019-09-08 01:25:39,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-08 01:25:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 599 transitions. [2019-09-08 01:25:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-09-08 01:25:39,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:39,243 INFO L399 BasicCegarLoop]: trace histogram [146, 146, 146, 146, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:39,243 INFO L418 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1777240517, now seen corresponding path program 144 times [2019-09-08 01:25:39,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:39,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:39,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:39,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:25:39,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 42486 backedges. 0 proven. 42486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:47,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:47,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:47,096 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:25:49,186 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 147 check-sat command(s) [2019-09-08 01:25:49,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:25:49,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 5093 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-08 01:25:49,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 42486 backedges. 0 proven. 42486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:49,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:49,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2019-09-08 01:25:49,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-08 01:25:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-08 01:25:49,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 01:25:49,428 INFO L87 Difference]: Start difference. First operand 598 states and 599 transitions. Second operand 149 states. [2019-09-08 01:25:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:25:50,540 INFO L93 Difference]: Finished difference Result 612 states and 614 transitions. [2019-09-08 01:25:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 01:25:50,540 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 596 [2019-09-08 01:25:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:25:50,541 INFO L225 Difference]: With dead ends: 612 [2019-09-08 01:25:50,542 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 01:25:50,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-09-08 01:25:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 01:25:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 602. [2019-09-08 01:25:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-08 01:25:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 603 transitions. [2019-09-08 01:25:50,547 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 603 transitions. Word has length 596 [2019-09-08 01:25:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:25:50,548 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 603 transitions. [2019-09-08 01:25:50,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-08 01:25:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 603 transitions. [2019-09-08 01:25:50,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-09-08 01:25:50,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:25:50,551 INFO L399 BasicCegarLoop]: trace histogram [147, 147, 147, 147, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:25:50,551 INFO L418 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:25:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:25:50,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2128376642, now seen corresponding path program 145 times [2019-09-08 01:25:50,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:25:50,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:25:50,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:50,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:25:50,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:25:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 43071 backedges. 0 proven. 43071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:58,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:25:58,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:25:58,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:25:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:25:59,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 5127 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-08 01:25:59,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:25:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 43071 backedges. 0 proven. 43071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:25:59,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:25:59,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 150 [2019-09-08 01:25:59,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-08 01:25:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-08 01:25:59,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-08 01:25:59,610 INFO L87 Difference]: Start difference. First operand 602 states and 603 transitions. Second operand 150 states. [2019-09-08 01:26:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:26:01,228 INFO L93 Difference]: Finished difference Result 616 states and 618 transitions. [2019-09-08 01:26:01,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-08 01:26:01,229 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 600 [2019-09-08 01:26:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:26:01,230 INFO L225 Difference]: With dead ends: 616 [2019-09-08 01:26:01,230 INFO L226 Difference]: Without dead ends: 609 [2019-09-08 01:26:01,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-08 01:26:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-08 01:26:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 606. [2019-09-08 01:26:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-08 01:26:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 607 transitions. [2019-09-08 01:26:01,237 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 607 transitions. Word has length 600 [2019-09-08 01:26:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:26:01,237 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 607 transitions. [2019-09-08 01:26:01,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-08 01:26:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 607 transitions. [2019-09-08 01:26:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-09-08 01:26:01,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:26:01,240 INFO L399 BasicCegarLoop]: trace histogram [148, 148, 148, 148, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:26:01,240 INFO L418 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:26:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:26:01,240 INFO L82 PathProgramCache]: Analyzing trace with hash -532441911, now seen corresponding path program 146 times [2019-09-08 01:26:01,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:26:01,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:26:01,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:01,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:26:01,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:26:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 43660 backedges. 0 proven. 43660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:09,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:26:09,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:26:09,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:26:09,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:26:09,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:26:10,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 5161 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-08 01:26:10,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:26:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 43660 backedges. 0 proven. 43660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:10,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:26:10,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2019-09-08 01:26:10,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-08 01:26:10,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-08 01:26:10,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-08 01:26:10,277 INFO L87 Difference]: Start difference. First operand 606 states and 607 transitions. Second operand 151 states. [2019-09-08 01:26:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:26:12,201 INFO L93 Difference]: Finished difference Result 620 states and 622 transitions. [2019-09-08 01:26:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-08 01:26:12,201 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 604 [2019-09-08 01:26:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:26:12,202 INFO L225 Difference]: With dead ends: 620 [2019-09-08 01:26:12,202 INFO L226 Difference]: Without dead ends: 613 [2019-09-08 01:26:12,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-09-08 01:26:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-08 01:26:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2019-09-08 01:26:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-08 01:26:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 611 transitions. [2019-09-08 01:26:12,208 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 611 transitions. Word has length 604 [2019-09-08 01:26:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:26:12,208 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 611 transitions. [2019-09-08 01:26:12,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-08 01:26:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 611 transitions. [2019-09-08 01:26:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-09-08 01:26:12,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:26:12,211 INFO L399 BasicCegarLoop]: trace histogram [149, 149, 149, 149, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:26:12,211 INFO L418 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:26:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:26:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 245406416, now seen corresponding path program 147 times [2019-09-08 01:26:12,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:26:12,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:26:12,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:12,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:26:12,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:26:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44253 backedges. 0 proven. 44253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:20,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:26:20,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:26:20,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:26:22,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 150 check-sat command(s) [2019-09-08 01:26:22,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:26:22,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 5195 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-08 01:26:22,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:26:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 44253 backedges. 0 proven. 44253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:22,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:26:22,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 152 [2019-09-08 01:26:22,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-09-08 01:26:22,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-09-08 01:26:22,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-08 01:26:22,792 INFO L87 Difference]: Start difference. First operand 610 states and 611 transitions. Second operand 152 states. [2019-09-08 01:26:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:26:24,918 INFO L93 Difference]: Finished difference Result 624 states and 626 transitions. [2019-09-08 01:26:24,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-08 01:26:24,919 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 608 [2019-09-08 01:26:24,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:26:24,920 INFO L225 Difference]: With dead ends: 624 [2019-09-08 01:26:24,920 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 01:26:24,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-08 01:26:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 01:26:24,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2019-09-08 01:26:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 01:26:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 615 transitions. [2019-09-08 01:26:24,926 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 615 transitions. Word has length 608 [2019-09-08 01:26:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:26:24,926 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 615 transitions. [2019-09-08 01:26:24,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-09-08 01:26:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 615 transitions. [2019-09-08 01:26:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-09-08 01:26:24,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:26:24,929 INFO L399 BasicCegarLoop]: trace histogram [150, 150, 150, 150, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:26:24,929 INFO L418 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:26:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:26:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash 460146007, now seen corresponding path program 148 times [2019-09-08 01:26:24,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:26:24,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:26:24,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:24,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:26:24,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:26:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 44850 backedges. 0 proven. 44850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:33,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:26:33,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 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:26:33,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:26:33,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:26:33,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:26:33,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 5229 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-08 01:26:33,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:26:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 44850 backedges. 0 proven. 44850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:34,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:26:34,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2019-09-08 01:26:34,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-08 01:26:34,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-08 01:26:34,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-09-08 01:26:34,156 INFO L87 Difference]: Start difference. First operand 614 states and 615 transitions. Second operand 153 states. [2019-09-08 01:26:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:26:36,252 INFO L93 Difference]: Finished difference Result 628 states and 630 transitions. [2019-09-08 01:26:36,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-08 01:26:36,253 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 612 [2019-09-08 01:26:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:26:36,254 INFO L225 Difference]: With dead ends: 628 [2019-09-08 01:26:36,254 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 01:26:36,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-09-08 01:26:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 01:26:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2019-09-08 01:26:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 01:26:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 619 transitions. [2019-09-08 01:26:36,263 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 619 transitions. Word has length 612 [2019-09-08 01:26:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:26:36,263 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 619 transitions. [2019-09-08 01:26:36,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-08 01:26:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 619 transitions. [2019-09-08 01:26:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2019-09-08 01:26:36,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:26:36,266 INFO L399 BasicCegarLoop]: trace histogram [151, 151, 151, 151, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:26:36,266 INFO L418 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:26:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:26:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1162040414, now seen corresponding path program 149 times [2019-09-08 01:26:36,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:26:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:26:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:36,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:26:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:26:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 45451 backedges. 0 proven. 45451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:44,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:26:44,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:26:44,808 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:26:47,032 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 152 check-sat command(s) [2019-09-08 01:26:47,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:26:47,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 5263 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-08 01:26:47,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:26:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 45451 backedges. 0 proven. 45451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:47,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:26:47,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 154] total 154 [2019-09-08 01:26:47,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-08 01:26:47,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-08 01:26:47,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-08 01:26:47,294 INFO L87 Difference]: Start difference. First operand 618 states and 619 transitions. Second operand 154 states. [2019-09-08 01:26:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:26:49,464 INFO L93 Difference]: Finished difference Result 632 states and 634 transitions. [2019-09-08 01:26:49,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-08 01:26:49,465 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 616 [2019-09-08 01:26:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:26:49,466 INFO L225 Difference]: With dead ends: 632 [2019-09-08 01:26:49,466 INFO L226 Difference]: Without dead ends: 625 [2019-09-08 01:26:49,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-08 01:26:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-08 01:26:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 622. [2019-09-08 01:26:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-08 01:26:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 623 transitions. [2019-09-08 01:26:49,475 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 623 transitions. Word has length 616 [2019-09-08 01:26:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:26:49,475 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 623 transitions. [2019-09-08 01:26:49,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-08 01:26:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 623 transitions. [2019-09-08 01:26:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2019-09-08 01:26:49,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:26:49,480 INFO L399 BasicCegarLoop]: trace histogram [152, 152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:26:49,480 INFO L418 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:26:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:26:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1742505957, now seen corresponding path program 150 times [2019-09-08 01:26:49,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:26:49,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:26:49,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:49,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:26:49,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:26:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:26:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 46056 backedges. 0 proven. 46056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:26:57,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:26:57,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:26:57,903 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:27:00,136 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 153 check-sat command(s) [2019-09-08 01:27:00,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:27:00,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 5297 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-08 01:27:00,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:27:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 46056 backedges. 0 proven. 46056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:00,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:27:00,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2019-09-08 01:27:00,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-08 01:27:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-08 01:27:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-09-08 01:27:00,400 INFO L87 Difference]: Start difference. First operand 622 states and 623 transitions. Second operand 155 states. [2019-09-08 01:27:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:27:02,539 INFO L93 Difference]: Finished difference Result 636 states and 638 transitions. [2019-09-08 01:27:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-08 01:27:02,539 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 620 [2019-09-08 01:27:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:27:02,540 INFO L225 Difference]: With dead ends: 636 [2019-09-08 01:27:02,540 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 01:27:02,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-09-08 01:27:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 01:27:02,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2019-09-08 01:27:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 01:27:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 627 transitions. [2019-09-08 01:27:02,548 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 627 transitions. Word has length 620 [2019-09-08 01:27:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:27:02,548 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 627 transitions. [2019-09-08 01:27:02,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-08 01:27:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 627 transitions. [2019-09-08 01:27:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2019-09-08 01:27:02,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:27:02,551 INFO L399 BasicCegarLoop]: trace histogram [153, 153, 153, 153, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:27:02,552 INFO L418 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:27:02,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:27:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1813159916, now seen corresponding path program 151 times [2019-09-08 01:27:02,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:27:02,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:27:02,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:02,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:27:02,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:27:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 46665 backedges. 0 proven. 46665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:11,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:27:11,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:27:11,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:27:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:27:11,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 5331 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-08 01:27:11,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:27:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 46665 backedges. 0 proven. 46665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:12,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:27:12,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 156] total 156 [2019-09-08 01:27:12,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-08 01:27:12,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-08 01:27:12,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-08 01:27:12,098 INFO L87 Difference]: Start difference. First operand 626 states and 627 transitions. Second operand 156 states. [2019-09-08 01:27:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:27:13,755 INFO L93 Difference]: Finished difference Result 640 states and 642 transitions. [2019-09-08 01:27:13,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-08 01:27:13,756 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 624 [2019-09-08 01:27:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:27:13,757 INFO L225 Difference]: With dead ends: 640 [2019-09-08 01:27:13,757 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 01:27:13,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-08 01:27:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 01:27:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2019-09-08 01:27:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 01:27:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 631 transitions. [2019-09-08 01:27:13,764 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 631 transitions. Word has length 624 [2019-09-08 01:27:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:27:13,764 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 631 transitions. [2019-09-08 01:27:13,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-08 01:27:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2019-09-08 01:27:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-09-08 01:27:13,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:27:13,767 INFO L399 BasicCegarLoop]: trace histogram [154, 154, 154, 154, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:27:13,768 INFO L418 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:27:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:27:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1210098573, now seen corresponding path program 152 times [2019-09-08 01:27:13,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:27:13,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:27:13,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:13,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:27:13,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:27:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 47278 backedges. 0 proven. 47278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:22,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:27:22,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:27:22,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:27:23,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:27:23,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:27:23,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 5365 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-08 01:27:23,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:27:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 47278 backedges. 0 proven. 47278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:23,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:27:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2019-09-08 01:27:23,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-08 01:27:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-08 01:27:23,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 01:27:23,675 INFO L87 Difference]: Start difference. First operand 630 states and 631 transitions. Second operand 157 states. [2019-09-08 01:27:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:27:25,115 INFO L93 Difference]: Finished difference Result 644 states and 646 transitions. [2019-09-08 01:27:25,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-08 01:27:25,115 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 628 [2019-09-08 01:27:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:27:25,116 INFO L225 Difference]: With dead ends: 644 [2019-09-08 01:27:25,116 INFO L226 Difference]: Without dead ends: 637 [2019-09-08 01:27:25,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 01:27:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-08 01:27:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2019-09-08 01:27:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-08 01:27:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 635 transitions. [2019-09-08 01:27:25,123 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 635 transitions. Word has length 628 [2019-09-08 01:27:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:27:25,124 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 635 transitions. [2019-09-08 01:27:25,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-08 01:27:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 635 transitions. [2019-09-08 01:27:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-09-08 01:27:25,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:27:25,127 INFO L399 BasicCegarLoop]: trace histogram [155, 155, 155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:27:25,127 INFO L418 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:27:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:27:25,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1638105734, now seen corresponding path program 153 times [2019-09-08 01:27:25,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:27:25,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:27:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:25,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:27:25,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:27:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 47895 backedges. 0 proven. 47895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:34,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:27:34,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:27:34,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:27:36,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 156 check-sat command(s) [2019-09-08 01:27:36,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:27:36,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 5399 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-08 01:27:36,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:27:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 47895 backedges. 0 proven. 47895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:36,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:27:36,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158, 158] total 158 [2019-09-08 01:27:36,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-09-08 01:27:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-09-08 01:27:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-08 01:27:36,727 INFO L87 Difference]: Start difference. First operand 634 states and 635 transitions. Second operand 158 states. [2019-09-08 01:27:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:27:38,869 INFO L93 Difference]: Finished difference Result 648 states and 650 transitions. [2019-09-08 01:27:38,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-08 01:27:38,870 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 632 [2019-09-08 01:27:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:27:38,871 INFO L225 Difference]: With dead ends: 648 [2019-09-08 01:27:38,871 INFO L226 Difference]: Without dead ends: 641 [2019-09-08 01:27:38,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-08 01:27:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-08 01:27:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 638. [2019-09-08 01:27:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 01:27:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 639 transitions. [2019-09-08 01:27:38,877 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 639 transitions. Word has length 632 [2019-09-08 01:27:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:27:38,877 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 639 transitions. [2019-09-08 01:27:38,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-09-08 01:27:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 639 transitions. [2019-09-08 01:27:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-09-08 01:27:38,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:27:38,880 INFO L399 BasicCegarLoop]: trace histogram [156, 156, 156, 156, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:27:38,880 INFO L418 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:27:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:27:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash -809254143, now seen corresponding path program 154 times [2019-09-08 01:27:38,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:27:38,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:27:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:38,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:27:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:27:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 48516 backedges. 0 proven. 48516 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:47,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:27:47,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:27:47,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:27:48,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:27:48,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:27:48,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 5433 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-08 01:27:48,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:27:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 48516 backedges. 0 proven. 48516 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:48,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:27:48,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 159 [2019-09-08 01:27:48,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-08 01:27:48,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-08 01:27:49,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-09-08 01:27:49,000 INFO L87 Difference]: Start difference. First operand 638 states and 639 transitions. Second operand 159 states. [2019-09-08 01:27:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:27:50,437 INFO L93 Difference]: Finished difference Result 652 states and 654 transitions. [2019-09-08 01:27:50,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-08 01:27:50,437 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 636 [2019-09-08 01:27:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:27:50,438 INFO L225 Difference]: With dead ends: 652 [2019-09-08 01:27:50,438 INFO L226 Difference]: Without dead ends: 645 [2019-09-08 01:27:50,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-09-08 01:27:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-08 01:27:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 642. [2019-09-08 01:27:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 01:27:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 643 transitions. [2019-09-08 01:27:50,444 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 643 transitions. Word has length 636 [2019-09-08 01:27:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:27:50,444 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 643 transitions. [2019-09-08 01:27:50,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-08 01:27:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 643 transitions. [2019-09-08 01:27:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2019-09-08 01:27:50,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:27:50,448 INFO L399 BasicCegarLoop]: trace histogram [157, 157, 157, 157, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:27:50,448 INFO L418 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:27:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:27:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash -915477240, now seen corresponding path program 155 times [2019-09-08 01:27:50,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:27:50,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:27:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:50,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:27:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:27:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:27:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 49141 backedges. 0 proven. 49141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:27:59,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:27:59,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:27:59,512 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:28:01,804 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 158 check-sat command(s) [2019-09-08 01:28:01,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:28:01,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 5467 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-08 01:28:01,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:28:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 49141 backedges. 0 proven. 49141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:28:02,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:28:02,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160, 160] total 160 [2019-09-08 01:28:02,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-08 01:28:02,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-08 01:28:02,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-09-08 01:28:02,146 INFO L87 Difference]: Start difference. First operand 642 states and 643 transitions. Second operand 160 states. [2019-09-08 01:28:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:28:03,920 INFO L93 Difference]: Finished difference Result 656 states and 658 transitions. [2019-09-08 01:28:03,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-08 01:28:03,921 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 640 [2019-09-08 01:28:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:28:03,922 INFO L225 Difference]: With dead ends: 656 [2019-09-08 01:28:03,922 INFO L226 Difference]: Without dead ends: 649 [2019-09-08 01:28:03,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-09-08 01:28:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-08 01:28:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2019-09-08 01:28:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 01:28:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 647 transitions. [2019-09-08 01:28:03,929 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 647 transitions. Word has length 640 [2019-09-08 01:28:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:28:03,929 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 647 transitions. [2019-09-08 01:28:03,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-08 01:28:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 647 transitions. [2019-09-08 01:28:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2019-09-08 01:28:03,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:28:03,933 INFO L399 BasicCegarLoop]: trace histogram [158, 158, 158, 158, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:28:03,933 INFO L418 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:28:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:28:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1171766159, now seen corresponding path program 156 times [2019-09-08 01:28:03,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:28:03,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:28:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:28:03,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:28:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:28:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:28:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 49770 backedges. 0 proven. 49770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:28:13,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:28:13,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:28:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:28:15,521 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 159 check-sat command(s) [2019-09-08 01:28:15,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:28:15,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 5501 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-08 01:28:15,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:28:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 49770 backedges. 0 proven. 49770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:28:15,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:28:15,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 161 [2019-09-08 01:28:15,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-08 01:28:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-08 01:28:15,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-09-08 01:28:15,807 INFO L87 Difference]: Start difference. First operand 646 states and 647 transitions. Second operand 161 states. [2019-09-08 01:28:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:28:18,244 INFO L93 Difference]: Finished difference Result 660 states and 662 transitions. [2019-09-08 01:28:18,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-08 01:28:18,245 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 644 [2019-09-08 01:28:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:28:18,246 INFO L225 Difference]: With dead ends: 660 [2019-09-08 01:28:18,246 INFO L226 Difference]: Without dead ends: 653 [2019-09-08 01:28:18,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-09-08 01:28:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-08 01:28:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2019-09-08 01:28:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-08 01:28:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 651 transitions. [2019-09-08 01:28:18,252 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 651 transitions. Word has length 644 [2019-09-08 01:28:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:28:18,253 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 651 transitions. [2019-09-08 01:28:18,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-08 01:28:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 651 transitions. [2019-09-08 01:28:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2019-09-08 01:28:18,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:28:18,256 INFO L399 BasicCegarLoop]: trace histogram [159, 159, 159, 159, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:28:18,256 INFO L418 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:28:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:28:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1399329130, now seen corresponding path program 157 times [2019-09-08 01:28:18,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:28:18,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:28:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:28:18,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:28:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:28:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:28:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 50403 backedges. 0 proven. 50403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:28:27,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:28:27,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:28:27,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:28:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:28:28,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 5535 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-08 01:28:28,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:28:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 50403 backedges. 0 proven. 50403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:28:28,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:28:28,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162, 162] total 162 [2019-09-08 01:28:28,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-08 01:28:28,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-08 01:28:28,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-09-08 01:28:28,678 INFO L87 Difference]: Start difference. First operand 650 states and 651 transitions. Second operand 162 states. [2019-09-08 01:28:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:28:31,189 INFO L93 Difference]: Finished difference Result 664 states and 666 transitions. [2019-09-08 01:28:31,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-09-08 01:28:31,189 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 648 [2019-09-08 01:28:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:28:31,191 INFO L225 Difference]: With dead ends: 664 [2019-09-08 01:28:31,191 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 01:28:31,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-09-08 01:28:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 01:28:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2019-09-08 01:28:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-09-08 01:28:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 655 transitions. [2019-09-08 01:28:31,197 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 655 transitions. Word has length 648 [2019-09-08 01:28:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:28:31,197 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 655 transitions. [2019-09-08 01:28:31,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-08 01:28:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 655 transitions. [2019-09-08 01:28:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-09-08 01:28:31,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:28:31,200 INFO L399 BasicCegarLoop]: trace histogram [160, 160, 160, 160, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:28:31,201 INFO L418 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:28:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:28:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2107029987, now seen corresponding path program 158 times [2019-09-08 01:28:31,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:28:31,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:28:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:28:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:28:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:28:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:28:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 51040 backedges. 0 proven. 51040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:28:40,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:28:40,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:28:40,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:28:41,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:28:41,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:28:41,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 5569 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-08 01:28:41,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:28:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 51040 backedges. 0 proven. 51040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:28:41,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:28:41,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 163 [2019-09-08 01:28:41,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-08 01:28:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-08 01:28:41,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-09-08 01:28:41,729 INFO L87 Difference]: Start difference. First operand 654 states and 655 transitions. Second operand 163 states.