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/reducercommutativity/max60-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:10:24,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:10:24,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:10:24,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:10:24,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:10:24,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:10:24,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:10:24,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:10:24,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:10:24,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:10:24,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:10:24,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:10:24,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:10:24,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:10:24,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:10:24,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:10:24,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:10:24,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:10:24,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:10:24,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:10:24,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:10:24,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:10:24,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:10:24,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:10:24,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:10:24,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:10:24,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:10:24,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:10:24,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:10:24,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:10:24,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:10:24,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:10:24,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:10:24,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:10:24,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:10:24,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:10:24,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:10:24,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:10:24,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:10:24,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:10:24,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:10:24,089 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-07 11:10:24,104 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:10:24,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:10:24,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:10:24,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:10:24,106 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:10:24,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:10:24,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:10:24,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:10:24,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:10:24,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:10:24,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:10:24,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:10:24,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:10:24,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:10:24,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:10:24,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:10:24,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:10:24,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:10:24,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:10:24,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:10:24,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:10:24,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:10:24,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:10:24,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:10:24,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:10:24,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:10:24,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:10:24,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:10:24,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:10:24,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:10:24,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:10:24,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:10:24,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:10:24,162 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:10:24,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max60-2.i [2019-09-07 11:10:24,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3fd5e8f/94d316584fde4eee963d5bc2662148fc/FLAG5e37cf861 [2019-09-07 11:10:24,707 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:10:24,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max60-2.i [2019-09-07 11:10:24,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3fd5e8f/94d316584fde4eee963d5bc2662148fc/FLAG5e37cf861 [2019-09-07 11:10:25,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3fd5e8f/94d316584fde4eee963d5bc2662148fc [2019-09-07 11:10:25,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:10:25,075 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:10:25,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:10:25,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:10:25,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:10:25,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577fd898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25, skipping insertion in model container [2019-09-07 11:10:25,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,092 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:10:25,109 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:10:25,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:10:25,309 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:10:25,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:10:25,345 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:10:25,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25 WrapperNode [2019-09-07 11:10:25,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:10:25,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:10:25,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:10:25,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:10:25,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (1/1) ... [2019-09-07 11:10:25,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:10:25,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:10:25,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:10:25,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:10:25,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (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-07 11:10:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:10:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:10:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-09-07 11:10:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:10:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:10:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:10:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-09-07 11:10:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:10:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:10:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:10:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:10:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:10:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:10:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:10:25,862 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:10:25,863 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:10:25,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:10:25 BoogieIcfgContainer [2019-09-07 11:10:25,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:10:25,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:10:25,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:10:25,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:10:25,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:10:25" (1/3) ... [2019-09-07 11:10:25,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d2e7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:10:25, skipping insertion in model container [2019-09-07 11:10:25,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:25" (2/3) ... [2019-09-07 11:10:25,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d2e7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:10:25, skipping insertion in model container [2019-09-07 11:10:25,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:10:25" (3/3) ... [2019-09-07 11:10:25,877 INFO L109 eAbstractionObserver]: Analyzing ICFG max60-2.i [2019-09-07 11:10:25,893 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:10:25,901 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:10:25,916 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:10:25,954 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:10:25,955 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:10:25,955 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:10:25,955 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:10:25,955 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:10:25,955 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:10:25,955 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:10:25,955 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:10:25,956 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:10:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-07 11:10:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:10:25,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:25,978 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:25,981 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:25,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1379671032, now seen corresponding path program 1 times [2019-09-07 11:10:25,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:25,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:26,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:10:26,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:10:26,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:10:26,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:10:26,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:10:26,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:10:26,200 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-09-07 11:10:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:26,259 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-09-07 11:10:26,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:10:26,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 11:10:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:26,272 INFO L225 Difference]: With dead ends: 60 [2019-09-07 11:10:26,273 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 11:10:26,276 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-07 11:10:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 11:10:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-07 11:10:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 11:10:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-09-07 11:10:26,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2019-09-07 11:10:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:26,321 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-09-07 11:10:26,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:10:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-09-07 11:10:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 11:10:26,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:26,327 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:26,327 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash 551744077, now seen corresponding path program 1 times [2019-09-07 11:10:26,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:26,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:26,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:10:26,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:26,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 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-07 11:10:26,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:26,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:10:26,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:10:26,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:10:26,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 11:10:26,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:10:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:10:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:10:26,569 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 4 states. [2019-09-07 11:10:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:26,600 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-09-07 11:10:26,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:10:26,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-07 11:10:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:26,603 INFO L225 Difference]: With dead ends: 52 [2019-09-07 11:10:26,603 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 11:10:26,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-07 11:10:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 11:10:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-09-07 11:10:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 11:10:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-09-07 11:10:26,612 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2019-09-07 11:10:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:26,613 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-09-07 11:10:26,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:10:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-09-07 11:10:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 11:10:26,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:26,615 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:26,616 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash 727331048, now seen corresponding path program 1 times [2019-09-07 11:10:26,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:26,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:26,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:10:26,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:10:26,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:10:26,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:10:26,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:10:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:10:26,706 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 3 states. [2019-09-07 11:10:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:26,721 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-09-07 11:10:26,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:10:26,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-07 11:10:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:26,723 INFO L225 Difference]: With dead ends: 47 [2019-09-07 11:10:26,723 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 11:10:26,724 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-07 11:10:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 11:10:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-07 11:10:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 11:10:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-07 11:10:26,730 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 46 [2019-09-07 11:10:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:26,732 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-07 11:10:26,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:10:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-07 11:10:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 11:10:26,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:26,734 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:26,735 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash -270429754, now seen corresponding path program 1 times [2019-09-07 11:10:26,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:26,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:26,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:10:26,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:26,878 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-07 11:10:26,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:26,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:10:26,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:10:26,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:26,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 11:10:26,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:10:26,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:10:26,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:10:26,981 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-09-07 11:10:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:27,027 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-09-07 11:10:27,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:10:27,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-07 11:10:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:27,032 INFO L225 Difference]: With dead ends: 56 [2019-09-07 11:10:27,032 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 11:10:27,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:10:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 11:10:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-07 11:10:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 11:10:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-09-07 11:10:27,046 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 48 [2019-09-07 11:10:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:27,047 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-09-07 11:10:27,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:10:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-09-07 11:10:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:10:27,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:27,053 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:27,054 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:27,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1585951496, now seen corresponding path program 2 times [2019-09-07 11:10:27,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:27,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:27,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:27,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 11:10:27,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:27,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:27,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:10:27,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:27,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:27,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:10:27,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:10:27,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:27,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 11:10:27,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:10:27,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:10:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:10:27,263 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 7 states. [2019-09-07 11:10:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:27,337 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2019-09-07 11:10:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:10:27,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-09-07 11:10:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:27,339 INFO L225 Difference]: With dead ends: 65 [2019-09-07 11:10:27,339 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 11:10:27,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:10:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 11:10:27,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-07 11:10:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 11:10:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-09-07 11:10:27,350 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 50 [2019-09-07 11:10:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:27,350 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-09-07 11:10:27,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:10:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-09-07 11:10:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 11:10:27,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:27,352 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:27,352 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash 118381797, now seen corresponding path program 3 times [2019-09-07 11:10:27,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:27,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:27,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 11:10:27,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:27,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:27,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:27,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:10:27,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:27,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:10:27,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:27,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:27,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 11:10:27,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:10:27,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:10:27,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:10:27,582 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 6 states. [2019-09-07 11:10:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:27,632 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-09-07 11:10:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:10:27,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-07 11:10:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:27,634 INFO L225 Difference]: With dead ends: 71 [2019-09-07 11:10:27,635 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 11:10:27,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:10:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 11:10:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-09-07 11:10:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 11:10:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-09-07 11:10:27,655 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 64 [2019-09-07 11:10:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:27,655 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-09-07 11:10:27,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:10:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-09-07 11:10:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 11:10:27,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:27,659 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:27,659 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 12656000, now seen corresponding path program 4 times [2019-09-07 11:10:27,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:27,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:27,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-07 11:10:27,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:27,806 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-07 11:10:27,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:27,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:10:27,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:27,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:10:27,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-07 11:10:27,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:27,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2019-09-07 11:10:27,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:10:27,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:10:27,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:10:27,990 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 8 states. [2019-09-07 11:10:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:28,060 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2019-09-07 11:10:28,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:10:28,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-09-07 11:10:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:28,062 INFO L225 Difference]: With dead ends: 79 [2019-09-07 11:10:28,063 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 11:10:28,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:10:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 11:10:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-07 11:10:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:10:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-09-07 11:10:28,080 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 76 [2019-09-07 11:10:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:28,082 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-09-07 11:10:28,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:10:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-09-07 11:10:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 11:10:28,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:28,087 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:28,090 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:28,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1935614368, now seen corresponding path program 5 times [2019-09-07 11:10:28,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:28,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-07 11:10:28,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:28,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:28,260 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:28,358 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 11:10:28,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:28,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:10:28,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 11:10:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:28,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:10:28,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:10:28,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:10:28,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:10:28,405 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 7 states. [2019-09-07 11:10:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:28,449 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2019-09-07 11:10:28,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:10:28,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-09-07 11:10:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:28,451 INFO L225 Difference]: With dead ends: 85 [2019-09-07 11:10:28,451 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 11:10:28,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:10:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 11:10:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-09-07 11:10:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 11:10:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-09-07 11:10:28,458 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 80 [2019-09-07 11:10:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:28,458 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-09-07 11:10:28,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:10:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-09-07 11:10:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 11:10:28,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:28,460 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:28,460 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1506101179, now seen corresponding path program 6 times [2019-09-07 11:10:28,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-09-07 11:10:28,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:28,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:28,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 11:10:28,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:28,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:10:28,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 154 proven. 4 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-09-07 11:10:28,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:28,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 11:10:28,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:10:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:10:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:10:28,680 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 6 states. [2019-09-07 11:10:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:28,709 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-09-07 11:10:28,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:10:28,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-09-07 11:10:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:28,711 INFO L225 Difference]: With dead ends: 81 [2019-09-07 11:10:28,711 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 11:10:28,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:10:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 11:10:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-07 11:10:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 11:10:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-09-07 11:10:28,717 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 92 [2019-09-07 11:10:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:28,718 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-09-07 11:10:28,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:10:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-09-07 11:10:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 11:10:28,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:28,720 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:28,720 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:28,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:28,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1361671399, now seen corresponding path program 7 times [2019-09-07 11:10:28,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:28,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 11:10:28,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:28,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:28,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:28,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:10:28,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 11:10:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:28,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 11:10:28,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:10:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:10:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:10:28,926 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 8 states. [2019-09-07 11:10:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:28,960 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-09-07 11:10:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:10:28,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-09-07 11:10:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:28,962 INFO L225 Difference]: With dead ends: 94 [2019-09-07 11:10:28,962 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 11:10:28,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:10:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 11:10:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-07 11:10:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 11:10:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-09-07 11:10:28,969 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 94 [2019-09-07 11:10:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:28,969 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-09-07 11:10:28,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:10:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-09-07 11:10:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 11:10:28,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:28,971 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:28,971 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:28,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1936247003, now seen corresponding path program 8 times [2019-09-07 11:10:28,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:28,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:28,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:28,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 11:10:29,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:29,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:29,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:29,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:29,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:29,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:10:29,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-07 11:10:29,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:29,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 11:10:29,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:10:29,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:10:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:10:29,305 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 13 states. [2019-09-07 11:10:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:29,412 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2019-09-07 11:10:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:10:29,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-07 11:10:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:29,415 INFO L225 Difference]: With dead ends: 103 [2019-09-07 11:10:29,415 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 11:10:29,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:10:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 11:10:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-09-07 11:10:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 11:10:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-09-07 11:10:29,432 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 96 [2019-09-07 11:10:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:29,433 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-09-07 11:10:29,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:10:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-09-07 11:10:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 11:10:29,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:29,434 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:29,436 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash -767191368, now seen corresponding path program 9 times [2019-09-07 11:10:29,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:29,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:29,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-09-07 11:10:29,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:29,555 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) [2019-09-07 11:10:29,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:29,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 11:10:29,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:29,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:10:29,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 230 proven. 9 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 11:10:29,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:29,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:10:29,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:10:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:10:29,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:10:29,703 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 7 states. [2019-09-07 11:10:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:29,735 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2019-09-07 11:10:29,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:10:29,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2019-09-07 11:10:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:29,738 INFO L225 Difference]: With dead ends: 95 [2019-09-07 11:10:29,738 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 11:10:29,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:10:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 11:10:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-07 11:10:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 11:10:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-09-07 11:10:29,752 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 110 [2019-09-07 11:10:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:29,753 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-09-07 11:10:29,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:10:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-09-07 11:10:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 11:10:29,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:29,759 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:29,759 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1145695594, now seen corresponding path program 10 times [2019-09-07 11:10:29,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:29,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:29,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-07 11:10:29,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:29,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:29,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:10:29,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:10:29,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:29,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:10:29,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-07 11:10:30,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:30,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 11:10:30,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:10:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:10:30,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:10:30,055 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 15 states. [2019-09-07 11:10:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:30,133 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-09-07 11:10:30,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:10:30,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 112 [2019-09-07 11:10:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:30,134 INFO L225 Difference]: With dead ends: 117 [2019-09-07 11:10:30,134 INFO L226 Difference]: Without dead ends: 73 [2019-09-07 11:10:30,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:10:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-07 11:10:30,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-09-07 11:10:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-07 11:10:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-09-07 11:10:30,149 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 112 [2019-09-07 11:10:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:30,150 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-09-07 11:10:30,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:10:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2019-09-07 11:10:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 11:10:30,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:30,152 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 7, 7, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:30,152 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1108345331, now seen corresponding path program 11 times [2019-09-07 11:10:30,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:30,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:30,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:30,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:30,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-09-07 11:10:30,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:30,275 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:30,302 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:10:30,679 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-07 11:10:30,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:30,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:10:30,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 316 proven. 66 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-07 11:10:30,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:30,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-07 11:10:30,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:10:30,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:10:30,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:10:30,799 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 14 states. [2019-09-07 11:10:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:30,885 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-09-07 11:10:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:10:30,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 126 [2019-09-07 11:10:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:30,890 INFO L225 Difference]: With dead ends: 126 [2019-09-07 11:10:30,891 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 11:10:30,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:10:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 11:10:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-09-07 11:10:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 11:10:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-09-07 11:10:30,907 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 126 [2019-09-07 11:10:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:30,908 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-09-07 11:10:30,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:10:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-09-07 11:10:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 11:10:30,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:30,911 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 7, 7, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:30,911 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:30,912 INFO L82 PathProgramCache]: Analyzing trace with hash -193358484, now seen corresponding path program 12 times [2019-09-07 11:10:30,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:30,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:30,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:30,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:30,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-09-07 11:10:31,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:31,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:31,067 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:31,337 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 11:10:31,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:31,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:10:31,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 430 proven. 25 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:10:31,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:31,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 11:10:31,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:10:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:10:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:10:31,376 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 9 states. [2019-09-07 11:10:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:31,408 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2019-09-07 11:10:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:10:31,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2019-09-07 11:10:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:31,410 INFO L225 Difference]: With dead ends: 117 [2019-09-07 11:10:31,410 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 11:10:31,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:10:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 11:10:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-07 11:10:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 11:10:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-09-07 11:10:31,419 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 140 [2019-09-07 11:10:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:31,421 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-09-07 11:10:31,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:10:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-09-07 11:10:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 11:10:31,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:31,424 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 7, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:31,424 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:31,425 INFO L82 PathProgramCache]: Analyzing trace with hash 575380426, now seen corresponding path program 13 times [2019-09-07 11:10:31,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:31,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:31,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2019-09-07 11:10:31,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:31,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:31,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:31,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:10:31,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2019-09-07 11:10:31,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:31,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 11:10:31,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 11:10:31,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 11:10:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:10:31,777 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 11 states. [2019-09-07 11:10:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:31,816 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2019-09-07 11:10:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:10:31,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2019-09-07 11:10:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:31,819 INFO L225 Difference]: With dead ends: 136 [2019-09-07 11:10:31,819 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 11:10:31,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:10:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 11:10:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-07 11:10:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 11:10:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2019-09-07 11:10:31,829 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 142 [2019-09-07 11:10:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:31,829 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-09-07 11:10:31,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 11:10:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2019-09-07 11:10:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 11:10:31,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:31,831 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 8, 8, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:31,831 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash 718704012, now seen corresponding path program 14 times [2019-09-07 11:10:31,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:31,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:31,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-09-07 11:10:32,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:32,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:32,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:32,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:32,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:32,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:10:32,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2019-09-07 11:10:32,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:32,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 11:10:32,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:10:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:10:32,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:10:32,338 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 19 states. [2019-09-07 11:10:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:32,444 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2019-09-07 11:10:32,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:10:32,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2019-09-07 11:10:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:32,447 INFO L225 Difference]: With dead ends: 145 [2019-09-07 11:10:32,447 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 11:10:32,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:10:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 11:10:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-09-07 11:10:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 11:10:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-09-07 11:10:32,455 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 144 [2019-09-07 11:10:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:32,455 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-09-07 11:10:32,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:10:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-09-07 11:10:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 11:10:32,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:32,457 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:32,458 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash 369000425, now seen corresponding path program 15 times [2019-09-07 11:10:32,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:32,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1308 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2019-09-07 11:10:32,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:32,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:32,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:32,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:10:32,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:32,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:10:32,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1308 backedges. 554 proven. 36 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked. [2019-09-07 11:10:32,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:32,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 11:10:32,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:10:32,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:10:32,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:10:32,895 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 10 states. [2019-09-07 11:10:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:32,943 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2019-09-07 11:10:32,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:10:32,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2019-09-07 11:10:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:32,945 INFO L225 Difference]: With dead ends: 131 [2019-09-07 11:10:32,946 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 11:10:32,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:10:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 11:10:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-07 11:10:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 11:10:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-09-07 11:10:32,954 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 158 [2019-09-07 11:10:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:32,954 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-09-07 11:10:32,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:10:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-09-07 11:10:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-07 11:10:32,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:32,957 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 9, 9, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:32,957 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:32,958 INFO L82 PathProgramCache]: Analyzing trace with hash -95469881, now seen corresponding path program 16 times [2019-09-07 11:10:32,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:32,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:32,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:32,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:32,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-09-07 11:10:33,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:33,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:33,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:33,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:10:33,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:33,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:10:33,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2019-09-07 11:10:33,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:33,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 11:10:33,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:10:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:10:33,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:10:33,433 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 21 states. [2019-09-07 11:10:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:33,549 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2019-09-07 11:10:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:10:33,554 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 160 [2019-09-07 11:10:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:33,555 INFO L225 Difference]: With dead ends: 159 [2019-09-07 11:10:33,555 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 11:10:33,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:10:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 11:10:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-09-07 11:10:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-07 11:10:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-09-07 11:10:33,560 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 160 [2019-09-07 11:10:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:33,561 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-09-07 11:10:33,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:10:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-09-07 11:10:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 11:10:33,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:33,563 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:33,563 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:33,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:33,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1192750428, now seen corresponding path program 17 times [2019-09-07 11:10:33,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:33,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:33,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:33,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:33,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-07 11:10:33,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:33,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:33,736 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:34,359 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 11:10:34,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:34,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:10:34,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 688 proven. 153 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:34,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:34,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 11:10:34,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:10:34,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:10:34,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:10:34,526 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 20 states. [2019-09-07 11:10:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:34,639 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2019-09-07 11:10:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:10:34,640 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 174 [2019-09-07 11:10:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:34,641 INFO L225 Difference]: With dead ends: 168 [2019-09-07 11:10:34,641 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 11:10:34,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:10:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 11:10:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-09-07 11:10:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-07 11:10:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2019-09-07 11:10:34,646 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 174 [2019-09-07 11:10:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:34,647 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2019-09-07 11:10:34,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:10:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2019-09-07 11:10:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 11:10:34,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:34,649 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:34,649 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1362319773, now seen corresponding path program 18 times [2019-09-07 11:10:34,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:34,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:34,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:34,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:34,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2019-09-07 11:10:34,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:34,811 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-07 11:10:34,822 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:10:35,331 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2019-09-07 11:10:35,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:35,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 11:10:35,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:35,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:10:35,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:10:35,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:10:35,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:10:35,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-07 11:10:35,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:10:35,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:10:35,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:10:35,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:10:35,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-09-07 11:10:35,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:10:35,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:10:35,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2019-09-07 11:10:35,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:10:35,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:10:35,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:10:35,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:19 [2019-09-07 11:10:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 1167 proven. 235 refuted. 0 times theorem prover too weak. 607 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-07 11:10:36,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:36,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 28 [2019-09-07 11:10:36,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:10:36,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:10:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:10:36,286 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 28 states. [2019-09-07 11:10:37,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:37,182 INFO L93 Difference]: Finished difference Result 312 states and 370 transitions. [2019-09-07 11:10:37,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:10:37,183 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 188 [2019-09-07 11:10:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:37,184 INFO L225 Difference]: With dead ends: 312 [2019-09-07 11:10:37,184 INFO L226 Difference]: Without dead ends: 205 [2019-09-07 11:10:37,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=294, Invalid=1512, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:10:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-07 11:10:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2019-09-07 11:10:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-07 11:10:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2019-09-07 11:10:37,198 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 188 [2019-09-07 11:10:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:37,199 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2019-09-07 11:10:37,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:10:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2019-09-07 11:10:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 11:10:37,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:37,202 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:37,202 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 257169405, now seen corresponding path program 1 times [2019-09-07 11:10:37,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:37,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:37,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:37,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:37,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2019-09-07 11:10:37,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:37,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:37,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:37,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:10:37,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1926 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-07 11:10:37,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:37,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 11:10:37,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:10:37,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:10:37,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:10:37,578 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand 14 states. [2019-09-07 11:10:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:37,639 INFO L93 Difference]: Finished difference Result 364 states and 438 transitions. [2019-09-07 11:10:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:10:37,640 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 190 [2019-09-07 11:10:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:37,643 INFO L225 Difference]: With dead ends: 364 [2019-09-07 11:10:37,644 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 11:10:37,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:10:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 11:10:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-07 11:10:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-07 11:10:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2019-09-07 11:10:37,656 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 190 [2019-09-07 11:10:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:37,656 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2019-09-07 11:10:37,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:10:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2019-09-07 11:10:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 11:10:37,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:37,658 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 11, 11, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:37,658 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1277148607, now seen corresponding path program 2 times [2019-09-07 11:10:37,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:37,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:37,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:37,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2047 backedges. 0 proven. 1038 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2019-09-07 11:10:37,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:37,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:37,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:37,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:37,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:37,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:10:37,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2047 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:38,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:38,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 11:10:38,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:10:38,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:10:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:10:38,154 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand 25 states. [2019-09-07 11:10:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:38,278 INFO L93 Difference]: Finished difference Result 387 states and 477 transitions. [2019-09-07 11:10:38,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:10:38,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 192 [2019-09-07 11:10:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:38,280 INFO L225 Difference]: With dead ends: 387 [2019-09-07 11:10:38,281 INFO L226 Difference]: Without dead ends: 220 [2019-09-07 11:10:38,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:10:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-07 11:10:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2019-09-07 11:10:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-07 11:10:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2019-09-07 11:10:38,292 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 192 [2019-09-07 11:10:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:38,293 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2019-09-07 11:10:38,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:10:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2019-09-07 11:10:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-07 11:10:38,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:38,295 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 12, 12, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:38,296 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:38,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash 440529564, now seen corresponding path program 3 times [2019-09-07 11:10:38,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:38,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:38,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:38,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 2370 trivial. 0 not checked. [2019-09-07 11:10:38,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:38,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:38,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:39,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 11:10:39,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:39,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:10:39,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 1022 proven. 81 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2019-09-07 11:10:39,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:39,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 11:10:39,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:10:39,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:10:39,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:10:39,185 INFO L87 Difference]: Start difference. First operand 210 states and 250 transitions. Second operand 13 states. [2019-09-07 11:10:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:39,225 INFO L93 Difference]: Finished difference Result 314 states and 377 transitions. [2019-09-07 11:10:39,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:10:39,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 206 [2019-09-07 11:10:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:39,228 INFO L225 Difference]: With dead ends: 314 [2019-09-07 11:10:39,228 INFO L226 Difference]: Without dead ends: 213 [2019-09-07 11:10:39,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:10:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-07 11:10:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-07 11:10:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 11:10:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2019-09-07 11:10:39,238 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 206 [2019-09-07 11:10:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:39,239 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2019-09-07 11:10:39,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:10:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2019-09-07 11:10:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-07 11:10:39,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:39,241 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 12, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:39,241 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:39,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:39,241 INFO L82 PathProgramCache]: Analyzing trace with hash 6274042, now seen corresponding path program 4 times [2019-09-07 11:10:39,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:39,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:39,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:39,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 1251 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2019-09-07 11:10:39,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:39,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:10:39,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:10:39,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:10:39,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:39,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:10:39,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 2326 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-07 11:10:39,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:39,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-09-07 11:10:39,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 11:10:39,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 11:10:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:10:39,897 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 27 states. [2019-09-07 11:10:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:40,034 INFO L93 Difference]: Finished difference Result 417 states and 513 transitions. [2019-09-07 11:10:40,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:10:40,036 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 208 [2019-09-07 11:10:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:40,038 INFO L225 Difference]: With dead ends: 417 [2019-09-07 11:10:40,038 INFO L226 Difference]: Without dead ends: 236 [2019-09-07 11:10:40,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:10:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-07 11:10:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2019-09-07 11:10:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-07 11:10:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 269 transitions. [2019-09-07 11:10:40,052 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 269 transitions. Word has length 208 [2019-09-07 11:10:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:40,053 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 269 transitions. [2019-09-07 11:10:40,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 11:10:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 269 transitions. [2019-09-07 11:10:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 11:10:40,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:40,056 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 13, 13, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:40,056 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 79237719, now seen corresponding path program 5 times [2019-09-07 11:10:40,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:40,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:40,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:40,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:40,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2912 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-07 11:10:40,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:40,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:40,280 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:42,544 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-07 11:10:42,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:42,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:10:42,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2912 backedges. 1204 proven. 276 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:42,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-09-07 11:10:42,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:10:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:10:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:10:42,765 INFO L87 Difference]: Start difference. First operand 226 states and 269 transitions. Second operand 26 states. [2019-09-07 11:10:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:42,880 INFO L93 Difference]: Finished difference Result 442 states and 542 transitions. [2019-09-07 11:10:42,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:10:42,881 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 222 [2019-09-07 11:10:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:42,883 INFO L225 Difference]: With dead ends: 442 [2019-09-07 11:10:42,883 INFO L226 Difference]: Without dead ends: 250 [2019-09-07 11:10:42,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:10:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-07 11:10:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2019-09-07 11:10:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-07 11:10:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 286 transitions. [2019-09-07 11:10:42,894 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 286 transitions. Word has length 222 [2019-09-07 11:10:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:42,894 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 286 transitions. [2019-09-07 11:10:42,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:10:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 286 transitions. [2019-09-07 11:10:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 11:10:42,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:42,897 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 13, 13, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:42,897 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:42,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1624534448, now seen corresponding path program 6 times [2019-09-07 11:10:42,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:42,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:42,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:42,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:42,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3265 trivial. 0 not checked. [2019-09-07 11:10:43,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:43,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:43,191 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:10:44,793 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 11:10:44,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:44,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:10:44,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 1414 proven. 121 refuted. 0 times theorem prover too weak. 1851 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:44,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:44,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 11:10:44,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:10:44,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:10:44,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:10:44,876 INFO L87 Difference]: Start difference. First operand 240 states and 286 transitions. Second operand 15 states. [2019-09-07 11:10:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:44,927 INFO L93 Difference]: Finished difference Result 360 states and 433 transitions. [2019-09-07 11:10:44,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:10:44,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 236 [2019-09-07 11:10:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:44,929 INFO L225 Difference]: With dead ends: 360 [2019-09-07 11:10:44,929 INFO L226 Difference]: Without dead ends: 243 [2019-09-07 11:10:44,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:10:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-07 11:10:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-09-07 11:10:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 11:10:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 288 transitions. [2019-09-07 11:10:44,940 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 288 transitions. Word has length 236 [2019-09-07 11:10:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:44,940 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 288 transitions. [2019-09-07 11:10:44,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:10:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 288 transitions. [2019-09-07 11:10:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-07 11:10:44,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:44,943 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 13, 13, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:44,943 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash 669525550, now seen corresponding path program 7 times [2019-09-07 11:10:44,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:44,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:44,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:44,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:44,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3409 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-07 11:10:45,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:45,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:45,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:10:45,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3409 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 3240 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-07 11:10:45,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:45,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 11:10:45,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 11:10:45,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 11:10:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:10:45,386 INFO L87 Difference]: Start difference. First operand 242 states and 288 transitions. Second operand 17 states. [2019-09-07 11:10:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:45,454 INFO L93 Difference]: Finished difference Result 454 states and 546 transitions. [2019-09-07 11:10:45,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:10:45,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 238 [2019-09-07 11:10:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:45,456 INFO L225 Difference]: With dead ends: 454 [2019-09-07 11:10:45,456 INFO L226 Difference]: Without dead ends: 245 [2019-09-07 11:10:45,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:10:45,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-07 11:10:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-09-07 11:10:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-07 11:10:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 290 transitions. [2019-09-07 11:10:45,467 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 290 transitions. Word has length 238 [2019-09-07 11:10:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:45,467 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 290 transitions. [2019-09-07 11:10:45,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 11:10:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 290 transitions. [2019-09-07 11:10:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 11:10:45,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:45,470 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 14, 14, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:45,470 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:45,470 INFO L82 PathProgramCache]: Analyzing trace with hash -650346512, now seen corresponding path program 8 times [2019-09-07 11:10:45,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:45,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:45,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:45,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:45,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3436 backedges. 0 proven. 1737 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [2019-09-07 11:10:45,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:45,705 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-07 11:10:45,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:10:45,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:45,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:45,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:10:45,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3436 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-09-07 11:10:46,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:46,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 11:10:46,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:10:46,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:10:46,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:10:46,117 INFO L87 Difference]: Start difference. First operand 244 states and 290 transitions. Second operand 31 states. [2019-09-07 11:10:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:46,284 INFO L93 Difference]: Finished difference Result 477 states and 585 transitions. [2019-09-07 11:10:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:10:46,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 240 [2019-09-07 11:10:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:46,287 INFO L225 Difference]: With dead ends: 477 [2019-09-07 11:10:46,287 INFO L226 Difference]: Without dead ends: 268 [2019-09-07 11:10:46,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:10:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-07 11:10:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2019-09-07 11:10:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-07 11:10:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2019-09-07 11:10:46,299 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 240 [2019-09-07 11:10:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:46,300 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2019-09-07 11:10:46,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:10:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2019-09-07 11:10:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-07 11:10:46,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:46,302 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 15, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:46,302 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1147676339, now seen corresponding path program 9 times [2019-09-07 11:10:46,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:46,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3954 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 3810 trivial. 0 not checked. [2019-09-07 11:10:46,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:46,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:46,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:48,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 11:10:48,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:48,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:10:48,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3954 backedges. 1634 proven. 144 refuted. 0 times theorem prover too weak. 2176 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:48,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:48,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 11:10:48,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:10:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:10:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:10:48,370 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand 16 states. [2019-09-07 11:10:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:48,421 INFO L93 Difference]: Finished difference Result 386 states and 464 transitions. [2019-09-07 11:10:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:10:48,422 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 254 [2019-09-07 11:10:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:48,424 INFO L225 Difference]: With dead ends: 386 [2019-09-07 11:10:48,424 INFO L226 Difference]: Without dead ends: 261 [2019-09-07 11:10:48,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:10:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-07 11:10:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2019-09-07 11:10:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-07 11:10:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 309 transitions. [2019-09-07 11:10:48,436 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 309 transitions. Word has length 254 [2019-09-07 11:10:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:48,436 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 309 transitions. [2019-09-07 11:10:48,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:10:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 309 transitions. [2019-09-07 11:10:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-07 11:10:48,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:48,439 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 15, 15, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:48,440 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:48,440 INFO L82 PathProgramCache]: Analyzing trace with hash 862897579, now seen corresponding path program 10 times [2019-09-07 11:10:48,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:48,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:48,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 2010 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2019-09-07 11:10:48,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:48,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:48,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:48,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:10:48,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:48,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:10:48,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 3754 trivial. 0 not checked. [2019-09-07 11:10:49,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:49,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 11:10:49,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:10:49,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:10:49,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:10:49,149 INFO L87 Difference]: Start difference. First operand 260 states and 309 transitions. Second operand 33 states. [2019-09-07 11:10:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:49,326 INFO L93 Difference]: Finished difference Result 507 states and 621 transitions. [2019-09-07 11:10:49,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 11:10:49,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 256 [2019-09-07 11:10:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:49,331 INFO L225 Difference]: With dead ends: 507 [2019-09-07 11:10:49,331 INFO L226 Difference]: Without dead ends: 284 [2019-09-07 11:10:49,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:10:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-07 11:10:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2019-09-07 11:10:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-07 11:10:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 326 transitions. [2019-09-07 11:10:49,344 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 326 transitions. Word has length 256 [2019-09-07 11:10:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:49,344 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 326 transitions. [2019-09-07 11:10:49,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:10:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 326 transitions. [2019-09-07 11:10:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-07 11:10:49,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:49,347 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 16, 16, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:49,347 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash -474677112, now seen corresponding path program 11 times [2019-09-07 11:10:49,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:49,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:49,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:49,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:49,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4535 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 4366 trivial. 0 not checked. [2019-09-07 11:10:49,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:49,628 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-07 11:10:49,650 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:10:57,679 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-07 11:10:57,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:57,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:10:57,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4535 backedges. 1864 proven. 435 refuted. 0 times theorem prover too weak. 2236 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:57,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:10:57,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-09-07 11:10:57,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:10:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:10:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:10:57,980 INFO L87 Difference]: Start difference. First operand 274 states and 326 transitions. Second operand 32 states. [2019-09-07 11:10:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:58,151 INFO L93 Difference]: Finished difference Result 532 states and 650 transitions. [2019-09-07 11:10:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:10:58,152 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 270 [2019-09-07 11:10:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:58,154 INFO L225 Difference]: With dead ends: 532 [2019-09-07 11:10:58,154 INFO L226 Difference]: Without dead ends: 298 [2019-09-07 11:10:58,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:10:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-07 11:10:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 288. [2019-09-07 11:10:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-07 11:10:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 343 transitions. [2019-09-07 11:10:58,182 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 343 transitions. Word has length 270 [2019-09-07 11:10:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:58,183 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 343 transitions. [2019-09-07 11:10:58,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:10:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 343 transitions. [2019-09-07 11:10:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-07 11:10:58,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:58,186 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 16, 16, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:58,186 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash 476582913, now seen corresponding path program 12 times [2019-09-07 11:10:58,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:58,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:58,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 4927 trivial. 0 not checked. [2019-09-07 11:10:58,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:58,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:10:58,525 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:01,378 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 11:11:01,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:01,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 11:11:01,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5123 backedges. 2153 proven. 196 refuted. 0 times theorem prover too weak. 2774 trivial. 0 not checked. [2019-09-07 11:11:01,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:01,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 20 [2019-09-07 11:11:01,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:11:01,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:11:01,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:11:01,470 INFO L87 Difference]: Start difference. First operand 288 states and 343 transitions. Second operand 20 states. [2019-09-07 11:11:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:01,746 INFO L93 Difference]: Finished difference Result 432 states and 520 transitions. [2019-09-07 11:11:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:11:01,747 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 284 [2019-09-07 11:11:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:01,749 INFO L225 Difference]: With dead ends: 432 [2019-09-07 11:11:01,749 INFO L226 Difference]: Without dead ends: 291 [2019-09-07 11:11:01,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=429, Invalid=761, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:11:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-07 11:11:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2019-09-07 11:11:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-07 11:11:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 345 transitions. [2019-09-07 11:11:01,765 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 345 transitions. Word has length 284 [2019-09-07 11:11:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:01,765 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 345 transitions. [2019-09-07 11:11:01,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:11:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 345 transitions. [2019-09-07 11:11:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-07 11:11:01,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:01,774 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 16, 16, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:01,774 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1048327457, now seen corresponding path program 13 times [2019-09-07 11:11:01,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:01,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:01,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2019-09-07 11:11:02,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:02,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:11:02,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:02,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:11:02,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2019-09-07 11:11:02,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:02,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 11:11:02,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:11:02,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:11:02,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:11:02,386 INFO L87 Difference]: Start difference. First operand 290 states and 345 transitions. Second operand 20 states. [2019-09-07 11:11:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:02,460 INFO L93 Difference]: Finished difference Result 544 states and 654 transitions. [2019-09-07 11:11:02,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:11:02,460 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 286 [2019-09-07 11:11:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:02,462 INFO L225 Difference]: With dead ends: 544 [2019-09-07 11:11:02,462 INFO L226 Difference]: Without dead ends: 293 [2019-09-07 11:11:02,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:11:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-07 11:11:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-09-07 11:11:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-07 11:11:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 347 transitions. [2019-09-07 11:11:02,474 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 347 transitions. Word has length 286 [2019-09-07 11:11:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:02,475 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 347 transitions. [2019-09-07 11:11:02,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:11:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 347 transitions. [2019-09-07 11:11:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-07 11:11:02,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:02,477 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 17, 17, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:02,478 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2007554209, now seen corresponding path program 14 times [2019-09-07 11:11:02,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:02,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:02,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5185 backedges. 0 proven. 2616 refuted. 0 times theorem prover too weak. 2569 trivial. 0 not checked. [2019-09-07 11:11:02,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:02,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:11:02,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:11:02,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:11:02,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:02,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 11:11:02,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5185 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2019-09-07 11:11:03,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:03,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-09-07 11:11:03,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 11:11:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 11:11:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:11:03,343 INFO L87 Difference]: Start difference. First operand 292 states and 347 transitions. Second operand 37 states. [2019-09-07 11:11:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:03,561 INFO L93 Difference]: Finished difference Result 567 states and 693 transitions. [2019-09-07 11:11:03,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 11:11:03,561 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 288 [2019-09-07 11:11:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:03,563 INFO L225 Difference]: With dead ends: 567 [2019-09-07 11:11:03,564 INFO L226 Difference]: Without dead ends: 316 [2019-09-07 11:11:03,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:11:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-07 11:11:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 306. [2019-09-07 11:11:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-07 11:11:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2019-09-07 11:11:03,577 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 288 [2019-09-07 11:11:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:03,577 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2019-09-07 11:11:03,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 11:11:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2019-09-07 11:11:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-07 11:11:03,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:03,581 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 18, 18, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:03,581 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:03,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1192716674, now seen corresponding path program 15 times [2019-09-07 11:11:03,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:03,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:03,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:03,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:03,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5817 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 5592 trivial. 0 not checked. [2019-09-07 11:11:03,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:03,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:11:03,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:11:08,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 11:11:08,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:08,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:11:08,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5817 backedges. 2390 proven. 225 refuted. 0 times theorem prover too weak. 3202 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:11:08,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:08,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 11:11:08,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:11:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:11:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:11:08,705 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand 19 states. [2019-09-07 11:11:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:08,793 INFO L93 Difference]: Finished difference Result 458 states and 551 transitions. [2019-09-07 11:11:08,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:11:08,794 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 302 [2019-09-07 11:11:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:08,798 INFO L225 Difference]: With dead ends: 458 [2019-09-07 11:11:08,798 INFO L226 Difference]: Without dead ends: 309 [2019-09-07 11:11:08,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:11:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-07 11:11:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2019-09-07 11:11:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-07 11:11:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 366 transitions. [2019-09-07 11:11:08,819 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 366 transitions. Word has length 302 [2019-09-07 11:11:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:08,820 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 366 transitions. [2019-09-07 11:11:08,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:11:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 366 transitions. [2019-09-07 11:11:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-07 11:11:08,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:08,824 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 18, 18, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:08,824 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1294345692, now seen corresponding path program 16 times [2019-09-07 11:11:08,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:08,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:08,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:08,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:08,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 0 proven. 2949 refuted. 0 times theorem prover too weak. 2899 trivial. 0 not checked. [2019-09-07 11:11:09,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:09,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:11:09,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:09,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:11:09,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:09,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:11:09,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5524 trivial. 0 not checked. [2019-09-07 11:11:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:09,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 11:11:09,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 11:11:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 11:11:09,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:11:09,862 INFO L87 Difference]: Start difference. First operand 308 states and 366 transitions. Second operand 39 states. [2019-09-07 11:11:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:10,079 INFO L93 Difference]: Finished difference Result 597 states and 729 transitions. [2019-09-07 11:11:10,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 11:11:10,084 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 304 [2019-09-07 11:11:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:10,086 INFO L225 Difference]: With dead ends: 597 [2019-09-07 11:11:10,086 INFO L226 Difference]: Without dead ends: 332 [2019-09-07 11:11:10,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:11:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-07 11:11:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 322. [2019-09-07 11:11:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-07 11:11:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 383 transitions. [2019-09-07 11:11:10,100 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 383 transitions. Word has length 304 [2019-09-07 11:11:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:10,102 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 383 transitions. [2019-09-07 11:11:10,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 11:11:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 383 transitions. [2019-09-07 11:11:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-07 11:11:10,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:10,106 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 19, 19, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:10,107 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:10,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1469351225, now seen corresponding path program 17 times [2019-09-07 11:11:10,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:10,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:10,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:10,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6518 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 6262 trivial. 0 not checked. [2019-09-07 11:11:10,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:10,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:10,482 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:11:31,739 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-07 11:11:31,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:31,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:11:31,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6518 backedges. 2668 proven. 630 refuted. 0 times theorem prover too weak. 3220 trivial. 0 not checked. [2019-09-07 11:11:32,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:32,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2019-09-07 11:11:32,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 11:11:32,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 11:11:32,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:11:32,201 INFO L87 Difference]: Start difference. First operand 322 states and 383 transitions. Second operand 38 states. [2019-09-07 11:11:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:32,418 INFO L93 Difference]: Finished difference Result 622 states and 758 transitions. [2019-09-07 11:11:32,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 11:11:32,424 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 318 [2019-09-07 11:11:32,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:32,427 INFO L225 Difference]: With dead ends: 622 [2019-09-07 11:11:32,427 INFO L226 Difference]: Without dead ends: 346 [2019-09-07 11:11:32,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:11:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-07 11:11:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 336. [2019-09-07 11:11:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-07 11:11:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 400 transitions. [2019-09-07 11:11:32,444 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 400 transitions. Word has length 318 [2019-09-07 11:11:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:32,444 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 400 transitions. [2019-09-07 11:11:32,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 11:11:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 400 transitions. [2019-09-07 11:11:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-07 11:11:32,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:32,448 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 19, 19, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:32,448 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1207495730, now seen corresponding path program 18 times [2019-09-07 11:11:32,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:32,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:32,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:32,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 6931 trivial. 0 not checked. [2019-09-07 11:11:32,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:32,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:11:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:38,109 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 11:11:38,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:38,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 11:11:38,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 3011 proven. 289 refuted. 0 times theorem prover too weak. 3920 trivial. 0 not checked. [2019-09-07 11:11:38,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:38,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 23 [2019-09-07 11:11:38,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:11:38,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:11:38,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:11:38,260 INFO L87 Difference]: Start difference. First operand 336 states and 400 transitions. Second operand 23 states. [2019-09-07 11:11:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:38,691 INFO L93 Difference]: Finished difference Result 504 states and 607 transitions. [2019-09-07 11:11:38,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:11:38,692 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 332 [2019-09-07 11:11:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:38,695 INFO L225 Difference]: With dead ends: 504 [2019-09-07 11:11:38,695 INFO L226 Difference]: Without dead ends: 339 [2019-09-07 11:11:38,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=594, Invalid=1046, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 11:11:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-07 11:11:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2019-09-07 11:11:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-07 11:11:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 402 transitions. [2019-09-07 11:11:38,720 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 402 transitions. Word has length 332 [2019-09-07 11:11:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:38,720 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 402 transitions. [2019-09-07 11:11:38,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:11:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 402 transitions. [2019-09-07 11:11:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-07 11:11:38,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:38,723 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 19, 19, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:38,724 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash -660519408, now seen corresponding path program 19 times [2019-09-07 11:11:38,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:38,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:38,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:38,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7255 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 6894 trivial. 0 not checked. [2019-09-07 11:11:39,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:39,095 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-07 11:11:39,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:39,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:11:39,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7255 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 6894 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-07 11:11:39,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:39,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 11:11:39,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:11:39,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:11:39,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:11:39,333 INFO L87 Difference]: Start difference. First operand 338 states and 402 transitions. Second operand 23 states. [2019-09-07 11:11:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:39,429 INFO L93 Difference]: Finished difference Result 634 states and 762 transitions. [2019-09-07 11:11:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:11:39,429 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 334 [2019-09-07 11:11:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:39,432 INFO L225 Difference]: With dead ends: 634 [2019-09-07 11:11:39,432 INFO L226 Difference]: Without dead ends: 341 [2019-09-07 11:11:39,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:11:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-07 11:11:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2019-09-07 11:11:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-07 11:11:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 404 transitions. [2019-09-07 11:11:39,451 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 404 transitions. Word has length 334 [2019-09-07 11:11:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:39,451 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 404 transitions. [2019-09-07 11:11:39,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:11:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 404 transitions. [2019-09-07 11:11:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-07 11:11:39,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:39,456 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:39,457 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:39,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1943996370, now seen corresponding path program 20 times [2019-09-07 11:11:39,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:39,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:39,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7294 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 3619 trivial. 0 not checked. [2019-09-07 11:11:39,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:39,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:11:39,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:40,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:11:40,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:40,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:11:40,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7294 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 6894 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-07 11:11:40,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:40,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 11:11:40,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 11:11:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 11:11:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:11:40,634 INFO L87 Difference]: Start difference. First operand 340 states and 404 transitions. Second operand 43 states. [2019-09-07 11:11:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:40,862 INFO L93 Difference]: Finished difference Result 657 states and 801 transitions. [2019-09-07 11:11:40,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 11:11:40,862 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 336 [2019-09-07 11:11:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:40,865 INFO L225 Difference]: With dead ends: 657 [2019-09-07 11:11:40,865 INFO L226 Difference]: Without dead ends: 364 [2019-09-07 11:11:40,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:11:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-07 11:11:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2019-09-07 11:11:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-07 11:11:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 421 transitions. [2019-09-07 11:11:40,882 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 421 transitions. Word has length 336 [2019-09-07 11:11:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:40,883 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 421 transitions. [2019-09-07 11:11:40,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 11:11:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 421 transitions. [2019-09-07 11:11:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-07 11:11:40,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:40,887 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 21, 21, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:40,887 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash -111252945, now seen corresponding path program 21 times [2019-09-07 11:11:40,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:40,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:40,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 7716 trivial. 0 not checked. [2019-09-07 11:11:41,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:41,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:11:41,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:11:50,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-07 11:11:50,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:50,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:11:50,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 3290 proven. 324 refuted. 0 times theorem prover too weak. 4426 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:11:50,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:50,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 11:11:50,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:11:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:11:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:11:50,322 INFO L87 Difference]: Start difference. First operand 354 states and 421 transitions. Second operand 22 states. [2019-09-07 11:11:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:50,391 INFO L93 Difference]: Finished difference Result 530 states and 638 transitions. [2019-09-07 11:11:50,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:11:50,393 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 350 [2019-09-07 11:11:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:50,396 INFO L225 Difference]: With dead ends: 530 [2019-09-07 11:11:50,396 INFO L226 Difference]: Without dead ends: 357 [2019-09-07 11:11:50,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:11:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-07 11:11:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2019-09-07 11:11:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-07 11:11:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 423 transitions. [2019-09-07 11:11:50,409 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 423 transitions. Word has length 350 [2019-09-07 11:11:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:50,412 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 423 transitions. [2019-09-07 11:11:50,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:11:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 423 transitions. [2019-09-07 11:11:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-07 11:11:50,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:50,415 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 21, 21, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:50,415 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1368384371, now seen corresponding path program 22 times [2019-09-07 11:11:50,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:50,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:50,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8077 backedges. 0 proven. 4068 refuted. 0 times theorem prover too weak. 4009 trivial. 0 not checked. [2019-09-07 11:11:50,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:50,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:11:50,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:51,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:11:51,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:51,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:11:51,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8077 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 7636 trivial. 0 not checked. [2019-09-07 11:11:51,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:11:51,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-09-07 11:11:51,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 11:11:51,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 11:11:51,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 11:11:51,567 INFO L87 Difference]: Start difference. First operand 356 states and 423 transitions. Second operand 45 states. [2019-09-07 11:11:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:51,784 INFO L93 Difference]: Finished difference Result 687 states and 837 transitions. [2019-09-07 11:11:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 11:11:51,785 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 352 [2019-09-07 11:11:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:51,787 INFO L225 Difference]: With dead ends: 687 [2019-09-07 11:11:51,787 INFO L226 Difference]: Without dead ends: 380 [2019-09-07 11:11:51,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 11:11:51,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-07 11:11:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 370. [2019-09-07 11:11:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-07 11:11:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 440 transitions. [2019-09-07 11:11:51,805 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 440 transitions. Word has length 352 [2019-09-07 11:11:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:51,805 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 440 transitions. [2019-09-07 11:11:51,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 11:11:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 440 transitions. [2019-09-07 11:11:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-07 11:11:51,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:51,808 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 22, 22, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:51,809 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:51,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:51,809 INFO L82 PathProgramCache]: Analyzing trace with hash -873340822, now seen corresponding path program 23 times [2019-09-07 11:11:51,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:51,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:51,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8861 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 8500 trivial. 0 not checked. [2019-09-07 11:11:52,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:52,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:11:52,213 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:12:54,474 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-07 11:12:54,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:12:54,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:12:54,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:12:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8861 backedges. 3616 proven. 861 refuted. 0 times theorem prover too weak. 4384 trivial. 0 not checked. [2019-09-07 11:12:55,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:12:55,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-09-07 11:12:55,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 11:12:55,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 11:12:55,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:12:55,012 INFO L87 Difference]: Start difference. First operand 370 states and 440 transitions. Second operand 44 states. [2019-09-07 11:12:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:12:55,244 INFO L93 Difference]: Finished difference Result 712 states and 866 transitions. [2019-09-07 11:12:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 11:12:55,246 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 366 [2019-09-07 11:12:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:12:55,248 INFO L225 Difference]: With dead ends: 712 [2019-09-07 11:12:55,248 INFO L226 Difference]: Without dead ends: 394 [2019-09-07 11:12:55,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 11:12:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-07 11:12:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 384. [2019-09-07 11:12:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-07 11:12:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 457 transitions. [2019-09-07 11:12:55,261 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 457 transitions. Word has length 366 [2019-09-07 11:12:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:12:55,262 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 457 transitions. [2019-09-07 11:12:55,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 11:12:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 457 transitions. [2019-09-07 11:12:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-07 11:12:55,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:12:55,265 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 22, 22, 20, 20, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:12:55,266 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:12:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:12:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1377281309, now seen corresponding path program 24 times [2019-09-07 11:12:55,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:12:55,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:12:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:55,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:12:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:12:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:12:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9677 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 9277 trivial. 0 not checked. [2019-09-07 11:12:55,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:12:55,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:12:55,676 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:13:06,786 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-07 11:13:06,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:13:06,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:13:06,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:13:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9677 backedges. 3970 proven. 400 refuted. 0 times theorem prover too weak. 5307 trivial. 0 not checked. [2019-09-07 11:13:06,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:13:06,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 11:13:06,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 11:13:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 11:13:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:13:06,929 INFO L87 Difference]: Start difference. First operand 384 states and 457 transitions. Second operand 24 states. [2019-09-07 11:13:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:13:07,019 INFO L93 Difference]: Finished difference Result 576 states and 694 transitions. [2019-09-07 11:13:07,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 11:13:07,020 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 380 [2019-09-07 11:13:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:13:07,023 INFO L225 Difference]: With dead ends: 576 [2019-09-07 11:13:07,023 INFO L226 Difference]: Without dead ends: 387 [2019-09-07 11:13:07,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:13:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-07 11:13:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 386. [2019-09-07 11:13:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-09-07 11:13:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 459 transitions. [2019-09-07 11:13:07,035 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 459 transitions. Word has length 380 [2019-09-07 11:13:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:13:07,036 INFO L475 AbstractCegarLoop]: Abstraction has 386 states and 459 transitions. [2019-09-07 11:13:07,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 11:13:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 459 transitions. [2019-09-07 11:13:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-07 11:13:07,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:13:07,039 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 22, 22, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:13:07,040 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:13:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:13:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1795872705, now seen corresponding path program 25 times [2019-09-07 11:13:07,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:13:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:13:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:07,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:13:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:13:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9718 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 9234 trivial. 0 not checked. [2019-09-07 11:13:07,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:13:07,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:13:07,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:13:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:13:07,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:13:07,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:13:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9718 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 9234 trivial. 0 not checked. [2019-09-07 11:13:07,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:13:07,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 11:13:07,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:13:07,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:13:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:13:07,783 INFO L87 Difference]: Start difference. First operand 386 states and 459 transitions. Second operand 26 states. [2019-09-07 11:13:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:13:07,868 INFO L93 Difference]: Finished difference Result 724 states and 870 transitions. [2019-09-07 11:13:07,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:13:07,872 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 382 [2019-09-07 11:13:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:13:07,875 INFO L225 Difference]: With dead ends: 724 [2019-09-07 11:13:07,875 INFO L226 Difference]: Without dead ends: 389 [2019-09-07 11:13:07,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:13:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-07 11:13:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 388. [2019-09-07 11:13:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-07 11:13:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 461 transitions. [2019-09-07 11:13:07,888 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 461 transitions. Word has length 382 [2019-09-07 11:13:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:13:07,888 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 461 transitions. [2019-09-07 11:13:07,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:13:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 461 transitions. [2019-09-07 11:13:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-07 11:13:07,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:13:07,892 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 23, 23, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:13:07,892 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:13:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:13:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash 464080259, now seen corresponding path program 26 times [2019-09-07 11:13:07,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:13:07,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:13:07,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:07,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:13:07,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:13:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9763 backedges. 0 proven. 4914 refuted. 0 times theorem prover too weak. 4849 trivial. 0 not checked. [2019-09-07 11:13:08,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:13:08,327 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-07 11:13:08,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:13:08,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:13:08,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:13:08,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:13:08,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:13:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9763 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 9234 trivial. 0 not checked. [2019-09-07 11:13:09,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:13:09,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2019-09-07 11:13:09,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 11:13:09,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 11:13:09,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:13:09,022 INFO L87 Difference]: Start difference. First operand 388 states and 461 transitions. Second operand 49 states. [2019-09-07 11:13:09,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:13:09,279 INFO L93 Difference]: Finished difference Result 747 states and 909 transitions. [2019-09-07 11:13:09,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 11:13:09,280 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 384 [2019-09-07 11:13:09,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:13:09,282 INFO L225 Difference]: With dead ends: 747 [2019-09-07 11:13:09,282 INFO L226 Difference]: Without dead ends: 412 [2019-09-07 11:13:09,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:13:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-07 11:13:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 402. [2019-09-07 11:13:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-07 11:13:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 478 transitions. [2019-09-07 11:13:09,295 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 478 transitions. Word has length 384 [2019-09-07 11:13:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:13:09,295 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 478 transitions. [2019-09-07 11:13:09,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 11:13:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 478 transitions. [2019-09-07 11:13:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-07 11:13:09,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:13:09,299 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 24, 24, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:13:09,299 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:13:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:13:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1250716576, now seen corresponding path program 27 times [2019-09-07 11:13:09,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:13:09,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:13:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:09,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:13:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:13:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10623 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10182 trivial. 0 not checked. [2019-09-07 11:13:09,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:13:09,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:13:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:13:35,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-07 11:13:35,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:13:35,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:13:35,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:13:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10623 backedges. 4334 proven. 441 refuted. 0 times theorem prover too weak. 5848 trivial. 0 not checked. [2019-09-07 11:13:35,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:13:35,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 11:13:35,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:13:35,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:13:35,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:13:35,522 INFO L87 Difference]: Start difference. First operand 402 states and 478 transitions. Second operand 25 states. [2019-09-07 11:13:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:13:35,582 INFO L93 Difference]: Finished difference Result 602 states and 725 transitions. [2019-09-07 11:13:35,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 11:13:35,583 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 398 [2019-09-07 11:13:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:13:35,585 INFO L225 Difference]: With dead ends: 602 [2019-09-07 11:13:35,585 INFO L226 Difference]: Without dead ends: 405 [2019-09-07 11:13:35,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:13:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-07 11:13:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2019-09-07 11:13:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-09-07 11:13:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 480 transitions. [2019-09-07 11:13:35,597 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 480 transitions. Word has length 398 [2019-09-07 11:13:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:13:35,597 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 480 transitions. [2019-09-07 11:13:35,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:13:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 480 transitions. [2019-09-07 11:13:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-07 11:13:35,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:13:35,601 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 24, 24, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:13:35,601 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:13:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:13:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2105993662, now seen corresponding path program 28 times [2019-09-07 11:13:35,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:13:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:13:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:35,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:13:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:13:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10666 backedges. 0 proven. 5367 refuted. 0 times theorem prover too weak. 5299 trivial. 0 not checked. [2019-09-07 11:13:36,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:13:36,040 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-07 11:13:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:13:36,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:13:36,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:13:36,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:13:36,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:13:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10666 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10090 trivial. 0 not checked. [2019-09-07 11:13:36,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:13:36,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 11:13:36,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 11:13:36,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 11:13:36,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 11:13:36,795 INFO L87 Difference]: Start difference. First operand 404 states and 480 transitions. Second operand 51 states. [2019-09-07 11:13:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:13:37,076 INFO L93 Difference]: Finished difference Result 777 states and 945 transitions. [2019-09-07 11:13:37,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 11:13:37,076 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 400 [2019-09-07 11:13:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:13:37,078 INFO L225 Difference]: With dead ends: 777 [2019-09-07 11:13:37,078 INFO L226 Difference]: Without dead ends: 428 [2019-09-07 11:13:37,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 11:13:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-09-07 11:13:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 418. [2019-09-07 11:13:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-07 11:13:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 497 transitions. [2019-09-07 11:13:37,094 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 497 transitions. Word has length 400 [2019-09-07 11:13:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:13:37,094 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 497 transitions. [2019-09-07 11:13:37,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 11:13:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 497 transitions. [2019-09-07 11:13:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-07 11:13:37,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:13:37,099 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 25, 25, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:13:37,100 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:13:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:13:37,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1044950501, now seen corresponding path program 29 times [2019-09-07 11:13:37,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:13:37,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:13:37,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:37,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:13:37,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:13:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:13:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 11564 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 11080 trivial. 0 not checked. [2019-09-07 11:13:37,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:13:37,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 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-07 11:13:37,584 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:15:14,093 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2019-09-07 11:15:14,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:14,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:15:14,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11564 backedges. 4708 proven. 1128 refuted. 0 times theorem prover too weak. 5728 trivial. 0 not checked. [2019-09-07 11:15:14,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:14,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2019-09-07 11:15:14,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 11:15:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 11:15:14,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 11:15:14,718 INFO L87 Difference]: Start difference. First operand 418 states and 497 transitions. Second operand 50 states. [2019-09-07 11:15:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:14,908 INFO L93 Difference]: Finished difference Result 802 states and 974 transitions. [2019-09-07 11:15:14,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 11:15:14,908 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 414 [2019-09-07 11:15:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:14,912 INFO L225 Difference]: With dead ends: 802 [2019-09-07 11:15:14,912 INFO L226 Difference]: Without dead ends: 442 [2019-09-07 11:15:14,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 11:15:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-07 11:15:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2019-09-07 11:15:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-07 11:15:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 514 transitions. [2019-09-07 11:15:14,926 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 514 transitions. Word has length 414 [2019-09-07 11:15:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:14,926 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 514 transitions. [2019-09-07 11:15:14,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 11:15:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 514 transitions. [2019-09-07 11:15:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-07 11:15:14,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:14,930 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 25, 25, 23, 23, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:15:14,931 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:14,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1282367468, now seen corresponding path program 30 times [2019-09-07 11:15:14,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:14,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:14,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12494 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 11965 trivial. 0 not checked. [2019-09-07 11:15:15,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:15,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:15:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:15:32,885 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-07 11:15:32,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:32,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 11:15:32,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12494 backedges. 5159 proven. 529 refuted. 0 times theorem prover too weak. 6806 trivial. 0 not checked. [2019-09-07 11:15:33,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:33,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 29 [2019-09-07 11:15:33,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:15:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:15:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:15:33,014 INFO L87 Difference]: Start difference. First operand 432 states and 514 transitions. Second operand 29 states. [2019-09-07 11:15:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:33,503 INFO L93 Difference]: Finished difference Result 648 states and 781 transitions. [2019-09-07 11:15:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:15:33,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 428 [2019-09-07 11:15:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:33,510 INFO L225 Difference]: With dead ends: 648 [2019-09-07 11:15:33,510 INFO L226 Difference]: Without dead ends: 435 [2019-09-07 11:15:33,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1005, Invalid=1751, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 11:15:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-07 11:15:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 434. [2019-09-07 11:15:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-07 11:15:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 516 transitions. [2019-09-07 11:15:33,523 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 516 transitions. Word has length 428 [2019-09-07 11:15:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:33,524 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 516 transitions. [2019-09-07 11:15:33,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:15:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 516 transitions. [2019-09-07 11:15:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-09-07 11:15:33,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:33,528 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 25, 25, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:15:33,528 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1009074190, now seen corresponding path program 31 times [2019-09-07 11:15:33,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:33,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:33,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:33,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:33,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 12541 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 11916 trivial. 0 not checked. [2019-09-07 11:15:34,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:34,239 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-07 11:15:34,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:34,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 11:15:34,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12541 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 11916 trivial. 0 not checked. [2019-09-07 11:15:34,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:34,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 11:15:34,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:15:34,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:15:34,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:15:34,565 INFO L87 Difference]: Start difference. First operand 434 states and 516 transitions. Second operand 29 states. [2019-09-07 11:15:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:34,660 INFO L93 Difference]: Finished difference Result 814 states and 978 transitions. [2019-09-07 11:15:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:15:34,661 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 430 [2019-09-07 11:15:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:34,662 INFO L225 Difference]: With dead ends: 814 [2019-09-07 11:15:34,662 INFO L226 Difference]: Without dead ends: 437 [2019-09-07 11:15:34,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:15:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-07 11:15:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2019-09-07 11:15:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-09-07 11:15:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 518 transitions. [2019-09-07 11:15:34,675 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 518 transitions. Word has length 430 [2019-09-07 11:15:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:34,675 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 518 transitions. [2019-09-07 11:15:34,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:15:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 518 transitions. [2019-09-07 11:15:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-09-07 11:15:34,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:34,679 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 26, 26, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:15:34,680 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash 169994676, now seen corresponding path program 32 times [2019-09-07 11:15:34,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:34,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:34,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:34,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:34,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12592 backedges. 0 proven. 6333 refuted. 0 times theorem prover too weak. 6259 trivial. 0 not checked. [2019-09-07 11:15:35,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:35,275 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-07 11:15:35,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:15:35,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:15:35,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:35,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:15:35,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12592 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 11916 trivial. 0 not checked. [2019-09-07 11:15:36,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:36,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2019-09-07 11:15:36,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 11:15:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 11:15:36,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 11:15:36,102 INFO L87 Difference]: Start difference. First operand 436 states and 518 transitions. Second operand 55 states. [2019-09-07 11:15:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:36,372 INFO L93 Difference]: Finished difference Result 837 states and 1017 transitions. [2019-09-07 11:15:36,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 11:15:36,372 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 432 [2019-09-07 11:15:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:36,374 INFO L225 Difference]: With dead ends: 837 [2019-09-07 11:15:36,374 INFO L226 Difference]: Without dead ends: 460 [2019-09-07 11:15:36,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 11:15:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-07 11:15:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 450. [2019-09-07 11:15:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-07 11:15:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 535 transitions. [2019-09-07 11:15:36,387 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 535 transitions. Word has length 432 [2019-09-07 11:15:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:36,388 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 535 transitions. [2019-09-07 11:15:36,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 11:15:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 535 transitions. [2019-09-07 11:15:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-09-07 11:15:36,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:36,392 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 27, 27, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:15:36,392 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:36,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1024305903, now seen corresponding path program 33 times [2019-09-07 11:15:36,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:36,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:36,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:36,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:36,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13566 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 12990 trivial. 0 not checked. [2019-09-07 11:15:36,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:36,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 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-07 11:15:36,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:16:07,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-07 11:16:07,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:07,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 11:16:07,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13566 backedges. 5522 proven. 576 refuted. 0 times theorem prover too weak. 7468 trivial. 0 not checked. [2019-09-07 11:16:07,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:07,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 11:16:07,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:16:07,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:16:07,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:16:07,291 INFO L87 Difference]: Start difference. First operand 450 states and 535 transitions. Second operand 28 states. [2019-09-07 11:16:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:07,367 INFO L93 Difference]: Finished difference Result 674 states and 812 transitions. [2019-09-07 11:16:07,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 11:16:07,373 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 446 [2019-09-07 11:16:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:07,375 INFO L225 Difference]: With dead ends: 674 [2019-09-07 11:16:07,376 INFO L226 Difference]: Without dead ends: 453 [2019-09-07 11:16:07,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:16:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-07 11:16:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-09-07 11:16:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-09-07 11:16:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 537 transitions. [2019-09-07 11:16:07,389 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 537 transitions. Word has length 446 [2019-09-07 11:16:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:07,389 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 537 transitions. [2019-09-07 11:16:07,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:16:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 537 transitions. [2019-09-07 11:16:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-07 11:16:07,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:07,393 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 27, 27, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:07,393 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:07,393 INFO L82 PathProgramCache]: Analyzing trace with hash -235614865, now seen corresponding path program 34 times [2019-09-07 11:16:07,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:07,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:07,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:07,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:07,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 13615 backedges. 0 proven. 6846 refuted. 0 times theorem prover too weak. 6769 trivial. 0 not checked. [2019-09-07 11:16:07,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:07,920 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-07 11:16:07,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:16:08,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:16:08,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:08,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:16:08,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 13615 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 12886 trivial. 0 not checked. [2019-09-07 11:16:08,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:08,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2019-09-07 11:16:08,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 11:16:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 11:16:08,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 11:16:08,863 INFO L87 Difference]: Start difference. First operand 452 states and 537 transitions. Second operand 57 states. [2019-09-07 11:16:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:09,145 INFO L93 Difference]: Finished difference Result 867 states and 1053 transitions. [2019-09-07 11:16:09,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 11:16:09,145 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 448 [2019-09-07 11:16:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:09,146 INFO L225 Difference]: With dead ends: 867 [2019-09-07 11:16:09,147 INFO L226 Difference]: Without dead ends: 476 [2019-09-07 11:16:09,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 11:16:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-07 11:16:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 466. [2019-09-07 11:16:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-07 11:16:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 554 transitions. [2019-09-07 11:16:09,160 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 554 transitions. Word has length 448 [2019-09-07 11:16:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:09,161 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 554 transitions. [2019-09-07 11:16:09,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 11:16:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 554 transitions. [2019-09-07 11:16:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-09-07 11:16:09,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:09,165 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 28, 28, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:16:09,165 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash 455023180, now seen corresponding path program 35 times [2019-09-07 11:16:09,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:09,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:09,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:09,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14627 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 14002 trivial. 0 not checked. [2019-09-07 11:16:09,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:09,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:16:09,695 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:18:10,139 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-07 11:18:10,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:10,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:18:10,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14627 backedges. 5944 proven. 1431 refuted. 0 times theorem prover too weak. 7252 trivial. 0 not checked. [2019-09-07 11:18:10,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:10,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2019-09-07 11:18:10,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 11:18:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 11:18:10,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 11:18:10,845 INFO L87 Difference]: Start difference. First operand 466 states and 554 transitions. Second operand 56 states. [2019-09-07 11:18:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:11,100 INFO L93 Difference]: Finished difference Result 892 states and 1082 transitions. [2019-09-07 11:18:11,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 11:18:11,100 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 462 [2019-09-07 11:18:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:11,103 INFO L225 Difference]: With dead ends: 892 [2019-09-07 11:18:11,103 INFO L226 Difference]: Without dead ends: 490 [2019-09-07 11:18:11,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 11:18:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-07 11:18:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 480. [2019-09-07 11:18:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-07 11:18:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 571 transitions. [2019-09-07 11:18:11,115 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 571 transitions. Word has length 462 [2019-09-07 11:18:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:11,116 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 571 transitions. [2019-09-07 11:18:11,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 11:18:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 571 transitions. [2019-09-07 11:18:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-07 11:18:11,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:11,120 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 28, 28, 26, 26, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:11,120 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash -476316731, now seen corresponding path program 36 times [2019-09-07 11:18:11,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:11,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:11,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15671 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 14995 trivial. 0 not checked. [2019-09-07 11:18:11,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:11,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 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-07 11:18:11,684 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:18:39,710 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-07 11:18:39,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:39,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 11:18:39,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15671 backedges. 6449 proven. 676 refuted. 0 times theorem prover too weak. 8546 trivial. 0 not checked. [2019-09-07 11:18:39,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:39,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 32 [2019-09-07 11:18:39,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:18:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:18:39,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:18:39,881 INFO L87 Difference]: Start difference. First operand 480 states and 571 transitions. Second operand 32 states. [2019-09-07 11:18:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:40,612 INFO L93 Difference]: Finished difference Result 720 states and 868 transitions. [2019-09-07 11:18:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:18:40,613 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 476 [2019-09-07 11:18:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:40,616 INFO L225 Difference]: With dead ends: 720 [2019-09-07 11:18:40,616 INFO L226 Difference]: Without dead ends: 483 [2019-09-07 11:18:40,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1251, Invalid=2171, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 11:18:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-07 11:18:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 482. [2019-09-07 11:18:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-07 11:18:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 573 transitions. [2019-09-07 11:18:40,633 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 573 transitions. Word has length 476 [2019-09-07 11:18:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:40,633 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 573 transitions. [2019-09-07 11:18:40,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:18:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 573 transitions. [2019-09-07 11:18:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-07 11:18:40,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:40,637 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 28, 28, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:40,638 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:40,639 INFO L82 PathProgramCache]: Analyzing trace with hash -948224349, now seen corresponding path program 37 times [2019-09-07 11:18:40,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:40,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:40,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15724 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 14940 trivial. 0 not checked. [2019-09-07 11:18:41,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:41,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:18:41,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:18:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:41,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 11:18:41,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15724 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 14940 trivial. 0 not checked. [2019-09-07 11:18:41,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:41,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 11:18:41,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:18:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:18:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:18:41,626 INFO L87 Difference]: Start difference. First operand 482 states and 573 transitions. Second operand 32 states. [2019-09-07 11:18:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:41,722 INFO L93 Difference]: Finished difference Result 904 states and 1086 transitions. [2019-09-07 11:18:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:18:41,724 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 478 [2019-09-07 11:18:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:41,725 INFO L225 Difference]: With dead ends: 904 [2019-09-07 11:18:41,725 INFO L226 Difference]: Without dead ends: 485 [2019-09-07 11:18:41,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:18:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-07 11:18:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-09-07 11:18:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-07 11:18:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 575 transitions. [2019-09-07 11:18:41,739 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 575 transitions. Word has length 478 [2019-09-07 11:18:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:41,739 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 575 transitions. [2019-09-07 11:18:41,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:18:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 575 transitions. [2019-09-07 11:18:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-07 11:18:41,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:41,743 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 29, 29, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:41,744 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:41,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1941118053, now seen corresponding path program 38 times [2019-09-07 11:18:41,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:41,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:41,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:41,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:18:41,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15781 backedges. 0 proven. 7932 refuted. 0 times theorem prover too weak. 7849 trivial. 0 not checked. [2019-09-07 11:18:42,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:42,563 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-07 11:18:42,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:18:42,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:18:42,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:18:42,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:18:42,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:18:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15781 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 14940 trivial. 0 not checked. [2019-09-07 11:18:43,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:18:43,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2019-09-07 11:18:43,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 11:18:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 11:18:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 11:18:43,562 INFO L87 Difference]: Start difference. First operand 484 states and 575 transitions. Second operand 61 states. [2019-09-07 11:18:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:18:43,832 INFO L93 Difference]: Finished difference Result 927 states and 1125 transitions. [2019-09-07 11:18:43,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 11:18:43,832 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 480 [2019-09-07 11:18:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:18:43,834 INFO L225 Difference]: With dead ends: 927 [2019-09-07 11:18:43,834 INFO L226 Difference]: Without dead ends: 508 [2019-09-07 11:18:43,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 11:18:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-09-07 11:18:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 498. [2019-09-07 11:18:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-07 11:18:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 592 transitions. [2019-09-07 11:18:43,848 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 592 transitions. Word has length 480 [2019-09-07 11:18:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:18:43,848 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 592 transitions. [2019-09-07 11:18:43,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 11:18:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 592 transitions. [2019-09-07 11:18:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2019-09-07 11:18:43,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:18:43,852 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 30, 30, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:18:43,853 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:18:43,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:18:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash -520819646, now seen corresponding path program 39 times [2019-09-07 11:18:43,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:18:43,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:18:43,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:43,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:18:43,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:18:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:18:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16869 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 16140 trivial. 0 not checked. [2019-09-07 11:18:44,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:18:44,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:18:44,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:19:09,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-07 11:19:09,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:19:09,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:19:09,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:19:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16869 backedges. 6854 proven. 729 refuted. 0 times theorem prover too weak. 9286 trivial. 0 not checked. [2019-09-07 11:19:09,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:19:09,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 11:19:09,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:19:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:19:09,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:19:09,154 INFO L87 Difference]: Start difference. First operand 498 states and 592 transitions. Second operand 31 states. [2019-09-07 11:19:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:19:09,243 INFO L93 Difference]: Finished difference Result 746 states and 899 transitions. [2019-09-07 11:19:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 11:19:09,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 494 [2019-09-07 11:19:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:19:09,249 INFO L225 Difference]: With dead ends: 746 [2019-09-07 11:19:09,250 INFO L226 Difference]: Without dead ends: 501 [2019-09-07 11:19:09,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:19:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-07 11:19:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2019-09-07 11:19:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-07 11:19:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 594 transitions. [2019-09-07 11:19:09,262 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 594 transitions. Word has length 494 [2019-09-07 11:19:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:19:09,262 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 594 transitions. [2019-09-07 11:19:09,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:19:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 594 transitions. [2019-09-07 11:19:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-07 11:19:09,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:19:09,267 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 30, 30, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:19:09,267 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:19:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:19:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1600911456, now seen corresponding path program 40 times [2019-09-07 11:19:09,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:19:09,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:19:09,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:19:09,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:19:09,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:19:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:19:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16924 backedges. 0 proven. 8505 refuted. 0 times theorem prover too weak. 8419 trivial. 0 not checked. [2019-09-07 11:19:09,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:19:09,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 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-07 11:19:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:19:10,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:19:10,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:19:10,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:19:10,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:19:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16924 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 16024 trivial. 0 not checked. [2019-09-07 11:19:10,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:19:10,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 63 [2019-09-07 11:19:10,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 11:19:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 11:19:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 11:19:10,986 INFO L87 Difference]: Start difference. First operand 500 states and 594 transitions. Second operand 63 states. [2019-09-07 11:19:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:19:11,238 INFO L93 Difference]: Finished difference Result 957 states and 1161 transitions. [2019-09-07 11:19:11,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 11:19:11,239 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 496 [2019-09-07 11:19:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:19:11,240 INFO L225 Difference]: With dead ends: 957 [2019-09-07 11:19:11,240 INFO L226 Difference]: Without dead ends: 524 [2019-09-07 11:19:11,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 11:19:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-07 11:19:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 514. [2019-09-07 11:19:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-07 11:19:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 611 transitions. [2019-09-07 11:19:11,254 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 611 transitions. Word has length 496 [2019-09-07 11:19:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:19:11,255 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 611 transitions. [2019-09-07 11:19:11,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 11:19:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 611 transitions. [2019-09-07 11:19:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-09-07 11:19:11,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:19:11,259 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 31, 31, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:19:11,259 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:19:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:19:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1739815165, now seen corresponding path program 41 times [2019-09-07 11:19:11,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:19:11,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:19:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:19:11,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:19:11,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:19:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:19:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18050 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 17266 trivial. 0 not checked. [2019-09-07 11:19:11,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:19:11,932 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-07 11:19:11,943 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:22:05,029 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-09-07 11:22:05,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:22:05,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:22:05,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18050 backedges. 7324 proven. 1770 refuted. 0 times theorem prover too weak. 8956 trivial. 0 not checked. [2019-09-07 11:22:05,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:05,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 62 [2019-09-07 11:22:05,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 11:22:05,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 11:22:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 11:22:05,944 INFO L87 Difference]: Start difference. First operand 514 states and 611 transitions. Second operand 62 states. [2019-09-07 11:22:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:06,228 INFO L93 Difference]: Finished difference Result 982 states and 1190 transitions. [2019-09-07 11:22:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 11:22:06,229 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 510 [2019-09-07 11:22:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:06,230 INFO L225 Difference]: With dead ends: 982 [2019-09-07 11:22:06,230 INFO L226 Difference]: Without dead ends: 538 [2019-09-07 11:22:06,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 11:22:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-07 11:22:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 528. [2019-09-07 11:22:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-07 11:22:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 628 transitions. [2019-09-07 11:22:06,241 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 628 transitions. Word has length 510 [2019-09-07 11:22:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:06,241 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 628 transitions. [2019-09-07 11:22:06,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 11:22:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 628 transitions. [2019-09-07 11:22:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-07 11:22:06,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:06,246 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 31, 31, 29, 29, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:06,246 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:06,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 973385206, now seen corresponding path program 42 times [2019-09-07 11:22:06,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:06,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:06,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 18367 trivial. 0 not checked. [2019-09-07 11:22:06,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:06,902 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-07 11:22:06,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:22:57,160 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-07 11:22:57,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:22:57,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 11:22:57,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 7883 proven. 841 refuted. 0 times theorem prover too weak. 10484 trivial. 0 not checked. [2019-09-07 11:22:57,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:57,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 35 [2019-09-07 11:22:57,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 11:22:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 11:22:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:22:57,386 INFO L87 Difference]: Start difference. First operand 528 states and 628 transitions. Second operand 35 states. [2019-09-07 11:22:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:58,052 INFO L93 Difference]: Finished difference Result 792 states and 955 transitions. [2019-09-07 11:22:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 11:22:58,052 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 524 [2019-09-07 11:22:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:58,055 INFO L225 Difference]: With dead ends: 792 [2019-09-07 11:22:58,055 INFO L226 Difference]: Without dead ends: 531 [2019-09-07 11:22:58,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1524, Invalid=2636, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 11:22:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-07 11:22:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 530. [2019-09-07 11:22:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-09-07 11:22:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 630 transitions. [2019-09-07 11:22:58,067 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 630 transitions. Word has length 524 [2019-09-07 11:22:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:58,068 INFO L475 AbstractCegarLoop]: Abstraction has 530 states and 630 transitions. [2019-09-07 11:22:58,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 11:22:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 630 transitions. [2019-09-07 11:22:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-07 11:22:58,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:58,073 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 31, 31, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:58,073 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:58,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1067881428, now seen corresponding path program 43 times [2019-09-07 11:22:58,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:58,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:58,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:58,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:58,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 19267 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 18306 trivial. 0 not checked. [2019-09-07 11:22:58,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:58,850 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-07 11:22:58,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:22:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:59,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:22:59,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 19267 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 18306 trivial. 0 not checked. [2019-09-07 11:22:59,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:59,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 11:22:59,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 11:22:59,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 11:22:59,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:22:59,218 INFO L87 Difference]: Start difference. First operand 530 states and 630 transitions. Second operand 35 states. [2019-09-07 11:22:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:59,325 INFO L93 Difference]: Finished difference Result 994 states and 1194 transitions. [2019-09-07 11:22:59,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 11:22:59,326 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 526 [2019-09-07 11:22:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:59,328 INFO L225 Difference]: With dead ends: 994 [2019-09-07 11:22:59,328 INFO L226 Difference]: Without dead ends: 533 [2019-09-07 11:22:59,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:22:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-07 11:22:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 532. [2019-09-07 11:22:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-09-07 11:22:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 632 transitions. [2019-09-07 11:22:59,343 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 632 transitions. Word has length 526 [2019-09-07 11:22:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:59,343 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 632 transitions. [2019-09-07 11:22:59,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 11:22:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 632 transitions. [2019-09-07 11:22:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-09-07 11:22:59,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:59,348 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 32, 32, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:59,348 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1914119574, now seen corresponding path program 44 times [2019-09-07 11:22:59,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:59,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:59,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:22:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:23:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 19330 backedges. 0 proven. 9711 refuted. 0 times theorem prover too weak. 9619 trivial. 0 not checked. [2019-09-07 11:23:00,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:23:00,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 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-07 11:23:00,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:23:00,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:23:00,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:23:00,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:23:00,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:23:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19330 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 18306 trivial. 0 not checked. [2019-09-07 11:23:01,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:23:01,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 67 [2019-09-07 11:23:01,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 11:23:01,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 11:23:01,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:23:01,261 INFO L87 Difference]: Start difference. First operand 532 states and 632 transitions. Second operand 67 states. [2019-09-07 11:23:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:23:01,534 INFO L93 Difference]: Finished difference Result 1017 states and 1233 transitions. [2019-09-07 11:23:01,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 11:23:01,535 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 528 [2019-09-07 11:23:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:23:01,537 INFO L225 Difference]: With dead ends: 1017 [2019-09-07 11:23:01,537 INFO L226 Difference]: Without dead ends: 556 [2019-09-07 11:23:01,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:23:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-07 11:23:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 546. [2019-09-07 11:23:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-07 11:23:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 649 transitions. [2019-09-07 11:23:01,549 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 649 transitions. Word has length 528 [2019-09-07 11:23:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:23:01,549 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 649 transitions. [2019-09-07 11:23:01,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 11:23:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 649 transitions. [2019-09-07 11:23:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-07 11:23:01,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:23:01,554 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 33, 33, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:23:01,554 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:23:01,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:23:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash 65378803, now seen corresponding path program 45 times [2019-09-07 11:23:01,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:23:01,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:23:01,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:01,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:23:01,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:23:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 20532 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 19632 trivial. 0 not checked. [2019-09-07 11:23:02,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:23:02,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:23:02,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:23:59,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-07 11:23:59,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:23:59,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 11:23:59,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:23:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20532 backedges. 8395 proven. 900 refuted. 0 times theorem prover too weak. 11237 trivial. 0 not checked. [2019-09-07 11:23:59,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:23:59,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 36 [2019-09-07 11:23:59,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:23:59,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:23:59,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:23:59,313 INFO L87 Difference]: Start difference. First operand 546 states and 649 transitions. Second operand 36 states. [2019-09-07 11:23:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:23:59,988 INFO L93 Difference]: Finished difference Result 818 states and 986 transitions. [2019-09-07 11:23:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:23:59,989 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 542 [2019-09-07 11:23:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:23:59,991 INFO L225 Difference]: With dead ends: 818 [2019-09-07 11:23:59,991 INFO L226 Difference]: Without dead ends: 549 [2019-09-07 11:23:59,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1621, Invalid=2801, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 11:23:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-07 11:24:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 548. [2019-09-07 11:24:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-09-07 11:24:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 651 transitions. [2019-09-07 11:24:00,003 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 651 transitions. Word has length 542 [2019-09-07 11:24:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:24:00,004 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 651 transitions. [2019-09-07 11:24:00,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 11:24:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 651 transitions. [2019-09-07 11:24:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2019-09-07 11:24:00,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:24:00,009 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 33, 33, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:24:00,009 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:24:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:24:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash -946939823, now seen corresponding path program 46 times [2019-09-07 11:24:00,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:24:00,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:24:00,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:00,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:24:00,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:24:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20593 backedges. 0 proven. 10344 refuted. 0 times theorem prover too weak. 10249 trivial. 0 not checked. [2019-09-07 11:24:00,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:24:00,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:24:00,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:24:01,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:24:01,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:24:01,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1593 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:24:01,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:24:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20593 backedges. 8328 proven. 2016 refuted. 0 times theorem prover too weak. 10249 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (66)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:24:01,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:24:01,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 11:24:01,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 11:24:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 11:24:01,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:24:01,317 INFO L87 Difference]: Start difference. First operand 548 states and 651 transitions. Second operand 36 states. [2019-09-07 11:24:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:24:01,509 INFO L93 Difference]: Finished difference Result 1043 states and 1262 transitions. [2019-09-07 11:24:01,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:24:01,510 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 544 [2019-09-07 11:24:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:24:01,512 INFO L225 Difference]: With dead ends: 1043 [2019-09-07 11:24:01,513 INFO L226 Difference]: Without dead ends: 569 [2019-09-07 11:24:01,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 11:24:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-07 11:24:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 560. [2019-09-07 11:24:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-07 11:24:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 666 transitions. [2019-09-07 11:24:01,531 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 666 transitions. Word has length 544 [2019-09-07 11:24:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:24:01,531 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 666 transitions. [2019-09-07 11:24:01,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 11:24:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 666 transitions. [2019-09-07 11:24:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-07 11:24:01,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:24:01,537 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 99, 98, 33, 33, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:24:01,537 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:24:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:24:01,538 INFO L82 PathProgramCache]: Analyzing trace with hash 805968876, now seen corresponding path program 47 times [2019-09-07 11:24:01,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:24:01,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:24:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:01,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:24:01,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:24:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:24:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21766 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 20805 trivial. 0 not checked. [2019-09-07 11:24:02,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:24:02,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:24:02,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1