java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-benchs/Muller_Kahan.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:10:06,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:10:06,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:10:06,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:10:06,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:10:06,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:10:06,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:10:06,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:10:06,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:10:06,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:10:06,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:10:06,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:10:06,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:10:06,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:10:06,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:10:06,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:10:06,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:10:06,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:10:06,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:10:06,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:10:06,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:10:06,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:10:06,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:10:06,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:10:06,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:10:06,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:10:06,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:10:06,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:10:06,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:10:06,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:10:06,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:10:06,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:10:06,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:10:06,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:10:06,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:10:06,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:10:06,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:10:06,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:10:06,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:10:06,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:10:06,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:10:06,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:10:06,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:10:06,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:10:06,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:10:06,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:10:06,106 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:10:06,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:10:06,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:10:06,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:10:06,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:10:06,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:10:06,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:10:06,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:10:06,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:10:06,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:10:06,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:10:06,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:10:06,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:10:06,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:10:06,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:10:06,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:10:06,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:10:06,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:06,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:10:06,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:10:06,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:10:06,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:10:06,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:10:06,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:10:06,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:10:06,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:10:06,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:10:06,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:10:06,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:10:06,168 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:10:06,168 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/Muller_Kahan.c [2019-09-08 01:10:06,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5a9044e/97c78eeaac7543978f434cc67a8978c1/FLAG2934ae4ce [2019-09-08 01:10:06,718 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:10:06,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/Muller_Kahan.c [2019-09-08 01:10:06,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5a9044e/97c78eeaac7543978f434cc67a8978c1/FLAG2934ae4ce [2019-09-08 01:10:07,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5a9044e/97c78eeaac7543978f434cc67a8978c1 [2019-09-08 01:10:07,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:10:07,089 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:10:07,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:07,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:10:07,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:10:07,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635b5632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07, skipping insertion in model container [2019-09-08 01:10:07,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,103 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:10:07,117 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:10:07,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:07,323 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:10:07,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:07,364 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:10:07,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07 WrapperNode [2019-09-08 01:10:07,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:07,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:10:07,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:10:07,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:10:07,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (1/1) ... [2019-09-08 01:10:07,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:10:07,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:10:07,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:10:07,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:10:07,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:10:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:10:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 01:10:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:10:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:10:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 01:10:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:10:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:10:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:10:07,826 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:10:07,827 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 01:10:07,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:07 BoogieIcfgContainer [2019-09-08 01:10:07,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:10:07,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:10:07,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:10:07,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:10:07,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:10:07" (1/3) ... [2019-09-08 01:10:07,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa08a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:07, skipping insertion in model container [2019-09-08 01:10:07,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:07" (2/3) ... [2019-09-08 01:10:07,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa08a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:07, skipping insertion in model container [2019-09-08 01:10:07,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:07" (3/3) ... [2019-09-08 01:10:07,855 INFO L109 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2019-09-08 01:10:07,868 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:10:07,877 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:10:07,896 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:10:07,940 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:10:07,941 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:10:07,941 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:10:07,941 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:10:07,942 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:10:07,942 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:10:07,942 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:10:07,942 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:10:07,942 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:10:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-08 01:10:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:07,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:07,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:07,976 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2019-09-08 01:10:07,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:07,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:08,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:08,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:10:08,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:10:08,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:10:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:10:08,141 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-08 01:10:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,170 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-08 01:10:08,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:10:08,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 01:10:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,180 INFO L225 Difference]: With dead ends: 31 [2019-09-08 01:10:08,181 INFO L226 Difference]: Without dead ends: 12 [2019-09-08 01:10:08,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:10:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-08 01:10:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-08 01:10:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-08 01:10:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-08 01:10:08,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-08 01:10:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,223 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-08 01:10:08,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:10:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-08 01:10:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:08,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,225 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1877050693, now seen corresponding path program 1 times [2019-09-08 01:10:08,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:08,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:10:08,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:10:08,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:10:08,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:08,277 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-08 01:10:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,293 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-08 01:10:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:10:08,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-08 01:10:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,294 INFO L225 Difference]: With dead ends: 19 [2019-09-08 01:10:08,294 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 01:10:08,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 01:10:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-08 01:10:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-08 01:10:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-08 01:10:08,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-08 01:10:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,301 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-08 01:10:08,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:10:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-08 01:10:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 01:10:08,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,302 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,302 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1175909113, now seen corresponding path program 1 times [2019-09-08 01:10:08,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:08,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:08,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:08,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:10:08,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:08,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 01:10:08,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:10:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:10:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:08,483 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-08 01:10:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,534 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-08 01:10:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:10:08,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-08 01:10:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,536 INFO L225 Difference]: With dead ends: 21 [2019-09-08 01:10:08,536 INFO L226 Difference]: Without dead ends: 16 [2019-09-08 01:10:08,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-08 01:10:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-08 01:10:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 01:10:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-08 01:10:08,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-08 01:10:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,542 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-08 01:10:08,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:10:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-08 01:10:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:10:08,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,543 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,544 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1607619511, now seen corresponding path program 2 times [2019-09-08 01:10:08,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:08,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:08,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:08,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:08,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:08,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:10:08,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 01:10:08,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:10:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:10:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:10:08,663 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-08 01:10:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,713 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-08 01:10:08,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:10:08,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 01:10:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,715 INFO L225 Difference]: With dead ends: 23 [2019-09-08 01:10:08,715 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 01:10:08,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-08 01:10:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 01:10:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-08 01:10:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 01:10:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-08 01:10:08,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-08 01:10:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,722 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-08 01:10:08,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:10:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-08 01:10:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 01:10:08,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,723 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,724 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash -130515723, now seen corresponding path program 3 times [2019-09-08 01:10:08,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:08,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:10:08,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:08,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:10:08,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:08,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:10:08,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 01:10:08,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:10:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:10:08,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:08,866 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-08 01:10:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:08,914 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-08 01:10:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:10:08,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-08 01:10:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:08,922 INFO L225 Difference]: With dead ends: 25 [2019-09-08 01:10:08,922 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 01:10:08,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 01:10:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-08 01:10:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 01:10:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-08 01:10:08,935 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-08 01:10:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:08,935 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-08 01:10:08,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:10:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-08 01:10:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 01:10:08,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:08,938 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:08,938 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash 263802547, now seen corresponding path program 4 times [2019-09-08 01:10:08,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:08,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:08,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:09,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:09,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:09,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:09,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:09,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 01:10:09,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:10:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:10:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:09,135 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-08 01:10:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:09,191 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-08 01:10:09,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:10:09,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-08 01:10:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:09,192 INFO L225 Difference]: With dead ends: 27 [2019-09-08 01:10:09,193 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:10:09,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:10:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-08 01:10:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 01:10:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-08 01:10:09,198 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-08 01:10:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:09,199 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-08 01:10:09,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:10:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-08 01:10:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:10:09,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:09,200 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:09,201 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1246537969, now seen corresponding path program 5 times [2019-09-08 01:10:09,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:09,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:09,308 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:09,327 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 01:10:09,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:09,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:09,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 01:10:09,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:10:09,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:10:09,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:09,351 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-08 01:10:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:09,392 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-08 01:10:09,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:10:09,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-08 01:10:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:09,394 INFO L225 Difference]: With dead ends: 29 [2019-09-08 01:10:09,394 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 01:10:09,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 01:10:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-08 01:10:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:10:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-08 01:10:09,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-08 01:10:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:09,400 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-08 01:10:09,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:10:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-08 01:10:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:10:09,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:09,401 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:09,401 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:09,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:09,402 INFO L82 PathProgramCache]: Analyzing trace with hash 762473391, now seen corresponding path program 6 times [2019-09-08 01:10:09,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:09,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:09,521 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:09,548 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:10:09,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:09,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:09,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 01:10:09,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:10:09,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:10:09,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:09,566 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-08 01:10:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:09,610 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-08 01:10:09,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:10:09,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-08 01:10:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:09,612 INFO L225 Difference]: With dead ends: 31 [2019-09-08 01:10:09,612 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 01:10:09,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 01:10:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-08 01:10:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 01:10:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-08 01:10:09,618 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-08 01:10:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:09,618 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-08 01:10:09,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:10:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-08 01:10:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:10:09,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:09,619 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:09,620 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:09,620 INFO L82 PathProgramCache]: Analyzing trace with hash -567118099, now seen corresponding path program 7 times [2019-09-08 01:10:09,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:09,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:09,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,714 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-08 01:10:09,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:09,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 01:10:09,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:10:09,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:10:09,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:09,763 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-08 01:10:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:09,806 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-08 01:10:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:10:09,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-08 01:10:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:09,807 INFO L225 Difference]: With dead ends: 33 [2019-09-08 01:10:09,807 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:10:09,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:10:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 01:10:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 01:10:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-08 01:10:09,813 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-08 01:10:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:09,813 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-08 01:10:09,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:10:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-08 01:10:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 01:10:09,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:09,814 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:09,815 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:09,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1595714219, now seen corresponding path program 8 times [2019-09-08 01:10:09,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:09,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:09,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:09,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:09,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:09,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:09,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:09,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:09,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:10:09,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:10,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 01:10:10,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:10:10,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:10:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:10,014 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-08 01:10:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:10,066 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-08 01:10:10,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:10:10,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-08 01:10:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:10,068 INFO L225 Difference]: With dead ends: 35 [2019-09-08 01:10:10,068 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 01:10:10,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 01:10:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-08 01:10:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 01:10:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-08 01:10:10,073 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-08 01:10:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:10,074 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-08 01:10:10,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:10:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-08 01:10:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:10:10,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:10,075 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:10,075 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:10,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400553, now seen corresponding path program 9 times [2019-09-08 01:10:10,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:10,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:10,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:10,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:10,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:10,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:10:10,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:10,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:10:10,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:10,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 01:10:10,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:10:10,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:10:10,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:10,301 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-08 01:10:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:10,374 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-08 01:10:10,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:10:10,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-08 01:10:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:10,377 INFO L225 Difference]: With dead ends: 37 [2019-09-08 01:10:10,377 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 01:10:10,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 01:10:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-08 01:10:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:10:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-08 01:10:10,388 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-08 01:10:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:10,389 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-08 01:10:10,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:10:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-08 01:10:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:10:10,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:10,390 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:10,391 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:10,392 INFO L82 PathProgramCache]: Analyzing trace with hash 592907175, now seen corresponding path program 10 times [2019-09-08 01:10:10,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:10,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:10,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:10,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:10,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:10,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:10,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:10,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:10,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:10:10,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:10,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-08 01:10:10,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:10:10,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:10:10,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:10:10,655 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2019-09-08 01:10:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:10,732 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-08 01:10:10,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:10:10,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-08 01:10:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:10,734 INFO L225 Difference]: With dead ends: 39 [2019-09-08 01:10:10,734 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 01:10:10,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:10:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 01:10:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-08 01:10:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 01:10:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-08 01:10:10,739 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-08 01:10:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:10,740 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-08 01:10:10,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:10:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-08 01:10:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 01:10:10,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:10,741 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:10,741 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:10,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:10,742 INFO L82 PathProgramCache]: Analyzing trace with hash -311494427, now seen corresponding path program 11 times [2019-09-08 01:10:10,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:10,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:10,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:10,890 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:10,916 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 01:10:10,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:10,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:10:10,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:10,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:10,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-08 01:10:10,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:10:10,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:10:10,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:10:10,935 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-09-08 01:10:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:10,982 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-08 01:10:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 01:10:10,985 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-09-08 01:10:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:10,986 INFO L225 Difference]: With dead ends: 41 [2019-09-08 01:10:10,987 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 01:10:10,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:10:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 01:10:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-08 01:10:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 01:10:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-08 01:10:10,992 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-08 01:10:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:10,995 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-08 01:10:10,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:10:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-08 01:10:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 01:10:10,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:10,996 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:10,997 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1858040157, now seen corresponding path program 12 times [2019-09-08 01:10:10,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:10,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:11,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:11,179 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-08 01:10:11,191 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:11,225 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 01:10:11,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:11,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:10:11,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:11,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-08 01:10:11,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 01:10:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 01:10:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:10:11,255 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-09-08 01:10:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:11,348 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-08 01:10:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:10:11,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-08 01:10:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:11,350 INFO L225 Difference]: With dead ends: 43 [2019-09-08 01:10:11,350 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 01:10:11,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:10:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 01:10:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-08 01:10:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 01:10:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-08 01:10:11,361 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-08 01:10:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:11,362 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-08 01:10:11,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 01:10:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-08 01:10:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 01:10:11,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:11,370 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:11,371 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:11,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2029802271, now seen corresponding path program 13 times [2019-09-08 01:10:11,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:11,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:11,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:11,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:11,592 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-08 01:10:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:11,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 01:10:11,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:11,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-08 01:10:11,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:10:11,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:10:11,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:10:11,673 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-09-08 01:10:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:11,725 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-08 01:10:11,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:10:11,726 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-09-08 01:10:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:11,727 INFO L225 Difference]: With dead ends: 45 [2019-09-08 01:10:11,727 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 01:10:11,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:10:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 01:10:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-08 01:10:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 01:10:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-08 01:10:11,732 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-08 01:10:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:11,733 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-08 01:10:11,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:10:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-08 01:10:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 01:10:11,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:11,734 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:11,734 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:11,734 INFO L82 PathProgramCache]: Analyzing trace with hash 410530719, now seen corresponding path program 14 times [2019-09-08 01:10:11,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:11,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:11,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:11,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:11,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:11,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:11,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:11,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:11,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 01:10:11,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-08 01:10:12,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:10:12,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:10:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:10:12,032 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-09-08 01:10:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:12,101 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-08 01:10:12,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:10:12,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-09-08 01:10:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:12,103 INFO L225 Difference]: With dead ends: 47 [2019-09-08 01:10:12,103 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:10:12,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:10:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:10:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-08 01:10:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 01:10:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-08 01:10:12,110 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-08 01:10:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:12,110 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-08 01:10:12,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:10:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-08 01:10:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:10:12,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:12,111 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:12,112 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:12,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 518390493, now seen corresponding path program 15 times [2019-09-08 01:10:12,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:12,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:12,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:12,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:12,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:12,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:12,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 01:10:12,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:12,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:10:12,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:12,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-08 01:10:12,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 01:10:12,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 01:10:12,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:10:12,392 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-09-08 01:10:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:12,469 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-08 01:10:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 01:10:12,470 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-09-08 01:10:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:12,471 INFO L225 Difference]: With dead ends: 49 [2019-09-08 01:10:12,471 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 01:10:12,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:10:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 01:10:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-08 01:10:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:10:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-08 01:10:12,476 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-08 01:10:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:12,476 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-08 01:10:12,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 01:10:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-08 01:10:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 01:10:12,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:12,478 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:12,478 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1092418203, now seen corresponding path program 16 times [2019-09-08 01:10:12,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:12,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:12,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:12,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:12,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:12,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 01:10:12,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:12,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-08 01:10:12,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 01:10:12,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 01:10:12,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:10:12,734 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-09-08 01:10:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:12,782 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-08 01:10:12,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:10:12,782 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-09-08 01:10:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:12,783 INFO L225 Difference]: With dead ends: 51 [2019-09-08 01:10:12,783 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 01:10:12,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:10:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 01:10:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-08 01:10:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 01:10:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-08 01:10:12,790 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-08 01:10:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:12,790 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-08 01:10:12,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 01:10:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-08 01:10:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:10:12,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:12,796 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:12,796 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1317733671, now seen corresponding path program 17 times [2019-09-08 01:10:12,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:12,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:12,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:12,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:12,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:13,005 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:13,034 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 01:10:13,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:13,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 01:10:13,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:13,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:13,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-08 01:10:13,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:10:13,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:10:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:10:13,054 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2019-09-08 01:10:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:13,105 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-08 01:10:13,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:10:13,106 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-09-08 01:10:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:13,106 INFO L225 Difference]: With dead ends: 53 [2019-09-08 01:10:13,106 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 01:10:13,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:10:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 01:10:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-08 01:10:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 01:10:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-08 01:10:13,112 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-08 01:10:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:13,112 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-08 01:10:13,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:10:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-08 01:10:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 01:10:13,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:13,113 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:13,113 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:13,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1808655255, now seen corresponding path program 18 times [2019-09-08 01:10:13,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:13,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:13,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:13,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:13,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:13,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:13,337 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:13,388 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 01:10:13,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:13,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 01:10:13,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 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-08 01:10:13,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:13,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-08 01:10:13,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:10:13,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:10:13,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:10:13,413 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2019-09-08 01:10:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:13,502 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-08 01:10:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:10:13,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-09-08 01:10:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:13,504 INFO L225 Difference]: With dead ends: 55 [2019-09-08 01:10:13,504 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 01:10:13,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:10:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 01:10:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-08 01:10:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 01:10:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-08 01:10:13,512 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-08 01:10:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:13,513 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-08 01:10:13,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:10:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-08 01:10:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 01:10:13,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:13,516 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:13,516 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash -208694059, now seen corresponding path program 19 times [2019-09-08 01:10:13,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:13,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:13,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:13,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:13,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:13,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:13,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 01:10:13,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:13,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:13,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-08 01:10:13,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 01:10:13,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 01:10:13,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:10:13,810 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2019-09-08 01:10:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:13,876 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-08 01:10:13,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 01:10:13,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-08 01:10:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:13,878 INFO L225 Difference]: With dead ends: 57 [2019-09-08 01:10:13,878 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 01:10:13,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:10:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 01:10:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-08 01:10:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 01:10:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-08 01:10:13,883 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-08 01:10:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:13,883 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-08 01:10:13,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 01:10:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-08 01:10:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 01:10:13,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:13,884 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:13,885 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1851134317, now seen corresponding path program 20 times [2019-09-08 01:10:13,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:13,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:13,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:13,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:14,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:14,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:10:14,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:14,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:14,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:14,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 01:10:14,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:14,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:14,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-08 01:10:14,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 01:10:14,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 01:10:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:10:14,214 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2019-09-08 01:10:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:14,286 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-08 01:10:14,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 01:10:14,286 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-08 01:10:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:14,287 INFO L225 Difference]: With dead ends: 59 [2019-09-08 01:10:14,288 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 01:10:14,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:10:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 01:10:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-08 01:10:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 01:10:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-08 01:10:14,293 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-08 01:10:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:14,293 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-08 01:10:14,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 01:10:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-08 01:10:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 01:10:14,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:14,295 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:14,295 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash 311742673, now seen corresponding path program 21 times [2019-09-08 01:10:14,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:14,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:14,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:14,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:14,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:14,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:14,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:14,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:14,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-08 01:10:14,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:14,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 01:10:14,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 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-08 01:10:14,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:14,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-08 01:10:14,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 01:10:14,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 01:10:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:10:14,664 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2019-09-08 01:10:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:14,734 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-08 01:10:14,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 01:10:14,735 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2019-09-08 01:10:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:14,735 INFO L225 Difference]: With dead ends: 61 [2019-09-08 01:10:14,736 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 01:10:14,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-08 01:10:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 01:10:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-08 01:10:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 01:10:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-08 01:10:14,740 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-08 01:10:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:14,741 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-08 01:10:14,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 01:10:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-08 01:10:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 01:10:14,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:14,742 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:14,742 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash 72358799, now seen corresponding path program 22 times [2019-09-08 01:10:14,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:14,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:14,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:15,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:15,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:15,136 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:15,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:15,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:15,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 01:10:15,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:15,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:15,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-08 01:10:15,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 01:10:15,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 01:10:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:10:15,186 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-09-08 01:10:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:15,289 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-08 01:10:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 01:10:15,289 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-09-08 01:10:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:15,290 INFO L225 Difference]: With dead ends: 63 [2019-09-08 01:10:15,290 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 01:10:15,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-08 01:10:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 01:10:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-08 01:10:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 01:10:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-08 01:10:15,298 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-08 01:10:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:15,298 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-08 01:10:15,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 01:10:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-08 01:10:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 01:10:15,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:15,299 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:15,299 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1952689869, now seen corresponding path program 23 times [2019-09-08 01:10:15,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:15,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:15,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:15,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:15,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:15,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:15,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:15,654 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:15,706 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-08 01:10:15,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:15,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 01:10:15,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:15,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:15,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-08 01:10:15,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 01:10:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 01:10:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:10:15,726 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-09-08 01:10:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:15,823 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-08 01:10:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 01:10:15,823 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-08 01:10:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:15,824 INFO L225 Difference]: With dead ends: 65 [2019-09-08 01:10:15,825 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 01:10:15,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-08 01:10:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 01:10:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-08 01:10:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 01:10:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-08 01:10:15,829 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-08 01:10:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:15,829 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-08 01:10:15,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 01:10:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-08 01:10:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 01:10:15,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:15,830 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:15,830 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:15,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:15,830 INFO L82 PathProgramCache]: Analyzing trace with hash 769616523, now seen corresponding path program 24 times [2019-09-08 01:10:15,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:15,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:15,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:15,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:16,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:16,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:16,157 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:16,203 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-08 01:10:16,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:16,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 01:10:16,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 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-08 01:10:16,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:16,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-08 01:10:16,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 01:10:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 01:10:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:10:16,231 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2019-09-08 01:10:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:16,316 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-08 01:10:16,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 01:10:16,316 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-09-08 01:10:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:16,317 INFO L225 Difference]: With dead ends: 67 [2019-09-08 01:10:16,317 INFO L226 Difference]: Without dead ends: 62 [2019-09-08 01:10:16,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-08 01:10:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-08 01:10:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-08 01:10:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-08 01:10:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-08 01:10:16,322 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-08 01:10:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:16,322 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-08 01:10:16,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 01:10:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-08 01:10:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 01:10:16,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:16,323 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:16,324 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2002464457, now seen corresponding path program 25 times [2019-09-08 01:10:16,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:16,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:16,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:16,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:10:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:16,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 01:10:16,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:16,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:16,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-08 01:10:16,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 01:10:16,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 01:10:16,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:10:16,728 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-09-08 01:10:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:16,801 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-08 01:10:16,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 01:10:16,801 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-09-08 01:10:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:16,802 INFO L225 Difference]: With dead ends: 69 [2019-09-08 01:10:16,802 INFO L226 Difference]: Without dead ends: 64 [2019-09-08 01:10:16,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:10:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-08 01:10:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-08 01:10:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 01:10:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-08 01:10:16,806 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-08 01:10:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:16,806 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-08 01:10:16,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 01:10:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-08 01:10:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 01:10:16,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:16,807 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:16,808 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:16,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:16,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1358355335, now seen corresponding path program 26 times [2019-09-08 01:10:16,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:16,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:16,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:16,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:16,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:17,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:17,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:17,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:17,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:17,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:17,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 01:10:17,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:17,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:17,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-08 01:10:17,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 01:10:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 01:10:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:10:17,251 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2019-09-08 01:10:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:17,343 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-08 01:10:17,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 01:10:17,344 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-09-08 01:10:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:17,345 INFO L225 Difference]: With dead ends: 71 [2019-09-08 01:10:17,345 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 01:10:17,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-08 01:10:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 01:10:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-08 01:10:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-08 01:10:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-08 01:10:17,350 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-08 01:10:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:17,350 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-08 01:10:17,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 01:10:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-08 01:10:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 01:10:17,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:17,352 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:17,352 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash 844779717, now seen corresponding path program 27 times [2019-09-08 01:10:17,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:17,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:17,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:17,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:17,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:17,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:17,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:17,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-08 01:10:17,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:17,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 01:10:17,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:17,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:17,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-08 01:10:17,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 01:10:17,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 01:10:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:10:17,832 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2019-09-08 01:10:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:17,923 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-08 01:10:17,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 01:10:17,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-08 01:10:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:17,925 INFO L225 Difference]: With dead ends: 73 [2019-09-08 01:10:17,925 INFO L226 Difference]: Without dead ends: 68 [2019-09-08 01:10:17,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-08 01:10:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-08 01:10:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-08 01:10:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 01:10:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-08 01:10:17,929 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-08 01:10:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:17,929 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-08 01:10:17,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 01:10:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-08 01:10:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 01:10:17,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:17,930 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:17,931 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1219849859, now seen corresponding path program 28 times [2019-09-08 01:10:17,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:17,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:17,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:17,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:17,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:18,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:18,356 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-08 01:10:18,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:18,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:18,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:18,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 01:10:18,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:18,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:18,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-08 01:10:18,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 01:10:18,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 01:10:18,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:10:18,439 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2019-09-08 01:10:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:18,527 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-08 01:10:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 01:10:18,528 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-09-08 01:10:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:18,529 INFO L225 Difference]: With dead ends: 75 [2019-09-08 01:10:18,529 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 01:10:18,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-08 01:10:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 01:10:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-08 01:10:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 01:10:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-08 01:10:18,534 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-08 01:10:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:18,534 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-08 01:10:18,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 01:10:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-08 01:10:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 01:10:18,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:18,535 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:18,536 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash 885003457, now seen corresponding path program 29 times [2019-09-08 01:10:18,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:18,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:18,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:18,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:18,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:19,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:19,007 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-08 01:10:19,025 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:19,089 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-08 01:10:19,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:19,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 01:10:19,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:19,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:19,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-08 01:10:19,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 01:10:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 01:10:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:10:19,111 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2019-09-08 01:10:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:19,189 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-08 01:10:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 01:10:19,189 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-09-08 01:10:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:19,191 INFO L225 Difference]: With dead ends: 77 [2019-09-08 01:10:19,191 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 01:10:19,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:10:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 01:10:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-08 01:10:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-08 01:10:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-08 01:10:19,197 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-08 01:10:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:19,197 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-08 01:10:19,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 01:10:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-08 01:10:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 01:10:19,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:19,198 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:19,199 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1220158335, now seen corresponding path program 30 times [2019-09-08 01:10:19,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:19,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:19,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:19,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:19,770 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:19,834 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-08 01:10:19,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:19,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 01:10:19,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:19,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:19,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-08 01:10:19,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 01:10:19,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 01:10:19,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:10:19,866 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2019-09-08 01:10:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:19,966 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-08 01:10:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 01:10:19,967 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2019-09-08 01:10:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:19,967 INFO L225 Difference]: With dead ends: 79 [2019-09-08 01:10:19,967 INFO L226 Difference]: Without dead ends: 74 [2019-09-08 01:10:19,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 01:10:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-08 01:10:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-08 01:10:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 01:10:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-08 01:10:19,973 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-08 01:10:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:19,974 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-08 01:10:19,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 01:10:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-08 01:10:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 01:10:19,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:19,975 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:19,975 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1181448893, now seen corresponding path program 31 times [2019-09-08 01:10:19,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:19,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:19,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:19,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:19,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:20,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:20,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:20,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:20,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 01:10:20,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:20,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:20,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-08 01:10:20,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 01:10:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 01:10:20,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:10:20,626 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2019-09-08 01:10:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:20,749 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-08 01:10:20,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 01:10:20,750 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-08 01:10:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:20,751 INFO L225 Difference]: With dead ends: 81 [2019-09-08 01:10:20,752 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 01:10:20,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 01:10:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 01:10:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-08 01:10:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 01:10:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-08 01:10:20,757 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-08 01:10:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:20,758 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-08 01:10:20,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 01:10:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-08 01:10:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 01:10:20,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:20,759 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:20,760 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:20,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1658586501, now seen corresponding path program 32 times [2019-09-08 01:10:20,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:20,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:20,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:20,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:20,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:21,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:21,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:21,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:21,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:21,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:21,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-08 01:10:21,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:21,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:21,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-08 01:10:21,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 01:10:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 01:10:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:10:21,372 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2019-09-08 01:10:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:21,476 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-08 01:10:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 01:10:21,477 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-09-08 01:10:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:21,478 INFO L225 Difference]: With dead ends: 83 [2019-09-08 01:10:21,478 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 01:10:21,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 01:10:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 01:10:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-08 01:10:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 01:10:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-08 01:10:21,483 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-08 01:10:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:21,483 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-08 01:10:21,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 01:10:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-08 01:10:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 01:10:21,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:21,484 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:21,484 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash 666600121, now seen corresponding path program 33 times [2019-09-08 01:10:21,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:21,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:21,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:21,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:21,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:21,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:21,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:21,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:22,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-08 01:10:22,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:22,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-08 01:10:22,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:22,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:22,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-08 01:10:22,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 01:10:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 01:10:22,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:10:22,088 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2019-09-08 01:10:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:22,189 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-08 01:10:22,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 01:10:22,189 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-09-08 01:10:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:22,191 INFO L225 Difference]: With dead ends: 85 [2019-09-08 01:10:22,191 INFO L226 Difference]: Without dead ends: 80 [2019-09-08 01:10:22,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 01:10:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-08 01:10:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-08 01:10:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 01:10:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-08 01:10:22,195 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-08 01:10:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:22,196 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-08 01:10:22,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 01:10:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-08 01:10:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 01:10:22,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:22,197 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:22,197 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1787949943, now seen corresponding path program 34 times [2019-09-08 01:10:22,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:22,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:22,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:22,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:22,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:22,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:22,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:22,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:22,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 01:10:22,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:22,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:22,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-08 01:10:22,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-08 01:10:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-08 01:10:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:10:22,952 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2019-09-08 01:10:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:23,052 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-08 01:10:23,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 01:10:23,052 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-09-08 01:10:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:23,054 INFO L225 Difference]: With dead ends: 87 [2019-09-08 01:10:23,054 INFO L226 Difference]: Without dead ends: 82 [2019-09-08 01:10:23,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 01:10:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-08 01:10:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-08 01:10:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-08 01:10:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-08 01:10:23,057 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-08 01:10:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:23,057 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-08 01:10:23,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-08 01:10:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-08 01:10:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 01:10:23,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:23,059 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:23,059 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:23,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:23,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1368337589, now seen corresponding path program 35 times [2019-09-08 01:10:23,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:23,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:23,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:23,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:23,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:23,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:23,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:23,644 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:23,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-08 01:10:23,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:23,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 01:10:23,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:23,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:23,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-08 01:10:23,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 01:10:23,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 01:10:23,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:10:23,758 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2019-09-08 01:10:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:23,880 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-09-08 01:10:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 01:10:23,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-08 01:10:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:23,884 INFO L225 Difference]: With dead ends: 89 [2019-09-08 01:10:23,885 INFO L226 Difference]: Without dead ends: 84 [2019-09-08 01:10:23,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 01:10:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-08 01:10:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-08 01:10:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-08 01:10:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-08 01:10:23,889 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-08 01:10:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:23,890 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-08 01:10:23,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 01:10:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-08 01:10:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 01:10:23,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:23,891 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:23,891 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:23,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1847791219, now seen corresponding path program 36 times [2019-09-08 01:10:23,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:23,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:23,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:24,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:24,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 01:10:24,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:24,593 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-08 01:10:24,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:24,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 01:10:24,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:24,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:24,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-08 01:10:24,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-08 01:10:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-08 01:10:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:10:24,622 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2019-09-08 01:10:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:24,754 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-09-08 01:10:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 01:10:24,755 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2019-09-08 01:10:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:24,756 INFO L225 Difference]: With dead ends: 91 [2019-09-08 01:10:24,756 INFO L226 Difference]: Without dead ends: 86 [2019-09-08 01:10:24,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 01:10:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-08 01:10:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-08 01:10:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-08 01:10:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-08 01:10:24,761 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-08 01:10:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:24,761 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-08 01:10:24,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-08 01:10:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-08 01:10:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 01:10:24,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:24,762 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:24,763 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1253738319, now seen corresponding path program 37 times [2019-09-08 01:10:24,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:24,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:24,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:24,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:25,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:25,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:25,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:25,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 01:10:25,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:25,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:25,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-08 01:10:25,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 01:10:25,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 01:10:25,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:10:25,492 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2019-09-08 01:10:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:25,592 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-09-08 01:10:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 01:10:25,592 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-09-08 01:10:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:25,593 INFO L225 Difference]: With dead ends: 93 [2019-09-08 01:10:25,594 INFO L226 Difference]: Without dead ends: 88 [2019-09-08 01:10:25,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 01:10:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-08 01:10:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-08 01:10:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-08 01:10:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-08 01:10:25,598 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-08 01:10:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:25,598 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-08 01:10:25,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 01:10:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-08 01:10:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 01:10:25,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:25,599 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:25,600 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1116320913, now seen corresponding path program 38 times [2019-09-08 01:10:25,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:25,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:25,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:25,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:25,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:26,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:26,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:26,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:26,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:26,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:26,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 01:10:26,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:26,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:26,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-08 01:10:26,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-08 01:10:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-08 01:10:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:10:26,398 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2019-09-08 01:10:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:26,542 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-09-08 01:10:26,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 01:10:26,543 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-09-08 01:10:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:26,544 INFO L225 Difference]: With dead ends: 95 [2019-09-08 01:10:26,544 INFO L226 Difference]: Without dead ends: 90 [2019-09-08 01:10:26,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 01:10:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-08 01:10:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-08 01:10:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-08 01:10:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-08 01:10:26,548 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-08 01:10:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:26,549 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-08 01:10:26,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-08 01:10:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-08 01:10:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 01:10:26,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:26,550 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:26,550 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2092787373, now seen corresponding path program 39 times [2019-09-08 01:10:26,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:26,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:26,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:27,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:27,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:27,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:27,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-08 01:10:27,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:27,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-08 01:10:27,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:27,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:27,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-08 01:10:27,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 01:10:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 01:10:27,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:10:27,349 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2019-09-08 01:10:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:27,520 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-09-08 01:10:27,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 01:10:27,525 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-08 01:10:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:27,526 INFO L225 Difference]: With dead ends: 97 [2019-09-08 01:10:27,526 INFO L226 Difference]: Without dead ends: 92 [2019-09-08 01:10:27,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 01:10:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-08 01:10:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-08 01:10:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-08 01:10:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-08 01:10:27,530 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-08 01:10:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:27,531 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-08 01:10:27,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 01:10:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-08 01:10:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 01:10:27,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:27,532 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:27,532 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2035635605, now seen corresponding path program 40 times [2019-09-08 01:10:27,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:27,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:27,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:27,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:27,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:28,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:28,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:28,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:28,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:28,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:28,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 01:10:28,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:28,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:28,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-08 01:10:28,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-08 01:10:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-08 01:10:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:10:28,588 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2019-09-08 01:10:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:28,721 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-09-08 01:10:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 01:10:28,721 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2019-09-08 01:10:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:28,722 INFO L225 Difference]: With dead ends: 99 [2019-09-08 01:10:28,722 INFO L226 Difference]: Without dead ends: 94 [2019-09-08 01:10:28,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 01:10:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-08 01:10:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-08 01:10:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-08 01:10:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-08 01:10:28,728 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-08 01:10:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:28,728 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-08 01:10:28,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-08 01:10:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-08 01:10:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 01:10:28,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:28,730 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:28,730 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash -900335959, now seen corresponding path program 41 times [2019-09-08 01:10:28,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:28,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:28,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:28,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:29,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:29,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:29,558 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:29,644 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-08 01:10:29,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:29,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 01:10:29,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:29,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:29,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-08 01:10:29,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 01:10:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 01:10:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:10:29,666 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2019-09-08 01:10:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:29,820 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-09-08 01:10:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 01:10:29,824 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-09-08 01:10:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:29,825 INFO L225 Difference]: With dead ends: 101 [2019-09-08 01:10:29,826 INFO L226 Difference]: Without dead ends: 96 [2019-09-08 01:10:29,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 01:10:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-08 01:10:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-08 01:10:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-08 01:10:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-08 01:10:29,834 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-08 01:10:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:29,835 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-08 01:10:29,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 01:10:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-08 01:10:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 01:10:29,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:29,837 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:29,837 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:29,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash -799069337, now seen corresponding path program 42 times [2019-09-08 01:10:29,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:29,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:29,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:30,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:30,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:30,636 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:30,723 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-08 01:10:30,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:30,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 01:10:30,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:30,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:30,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-08 01:10:30,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-08 01:10:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-08 01:10:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:10:30,751 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2019-09-08 01:10:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:30,922 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-09-08 01:10:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 01:10:30,923 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2019-09-08 01:10:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:30,924 INFO L225 Difference]: With dead ends: 103 [2019-09-08 01:10:30,924 INFO L226 Difference]: Without dead ends: 98 [2019-09-08 01:10:30,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 01:10:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-08 01:10:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-08 01:10:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-08 01:10:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-08 01:10:30,930 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-08 01:10:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:30,931 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-08 01:10:30,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-08 01:10:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-08 01:10:30,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 01:10:30,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:30,932 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:30,932 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:30,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2028873893, now seen corresponding path program 43 times [2019-09-08 01:10:30,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:30,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:30,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:30,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:31,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:31,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:31,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:31,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-08 01:10:31,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:31,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:31,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-08 01:10:31,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-08 01:10:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-08 01:10:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:10:31,807 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2019-09-08 01:10:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:31,969 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-09-08 01:10:31,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 01:10:31,969 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-08 01:10:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:31,970 INFO L225 Difference]: With dead ends: 105 [2019-09-08 01:10:31,970 INFO L226 Difference]: Without dead ends: 100 [2019-09-08 01:10:31,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:10:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-08 01:10:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-08 01:10:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-08 01:10:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-08 01:10:31,975 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-08 01:10:31,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:31,976 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-08 01:10:31,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-08 01:10:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-08 01:10:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 01:10:31,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:31,977 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:31,977 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:31,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:31,977 INFO L82 PathProgramCache]: Analyzing trace with hash 968019555, now seen corresponding path program 44 times [2019-09-08 01:10:31,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:31,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:31,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:31,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:31,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:32,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:32,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:32,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:32,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:32,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:32,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-08 01:10:32,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:32,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:32,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-08 01:10:32,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-08 01:10:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-08 01:10:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:10:32,877 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2019-09-08 01:10:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:33,020 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-09-08 01:10:33,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 01:10:33,021 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2019-09-08 01:10:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:33,022 INFO L225 Difference]: With dead ends: 107 [2019-09-08 01:10:33,022 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 01:10:33,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 01:10:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 01:10:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-08 01:10:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-08 01:10:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-08 01:10:33,026 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-08 01:10:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:33,027 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-08 01:10:33,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-08 01:10:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-08 01:10:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 01:10:33,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:33,028 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:33,028 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:33,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:33,028 INFO L82 PathProgramCache]: Analyzing trace with hash -605750111, now seen corresponding path program 45 times [2019-09-08 01:10:33,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:33,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:33,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:33,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:33,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:33,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:33,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:34,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-08 01:10:34,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:34,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-08 01:10:34,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:34,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:34,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-08 01:10:34,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-08 01:10:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-08 01:10:34,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:10:34,039 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2019-09-08 01:10:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:34,224 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-09-08 01:10:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 01:10:34,224 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2019-09-08 01:10:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:34,225 INFO L225 Difference]: With dead ends: 109 [2019-09-08 01:10:34,225 INFO L226 Difference]: Without dead ends: 104 [2019-09-08 01:10:34,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 01:10:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-08 01:10:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-08 01:10:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-08 01:10:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-08 01:10:34,230 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-08 01:10:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:34,230 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-08 01:10:34,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-08 01:10:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-08 01:10:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 01:10:34,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:34,231 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:34,232 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1169910945, now seen corresponding path program 46 times [2019-09-08 01:10:34,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:34,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:34,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:34,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:34,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:35,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:35,567 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-08 01:10:35,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:35,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:35,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:35,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 01:10:35,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:35,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:35,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-08 01:10:35,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 01:10:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 01:10:35,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:10:35,670 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2019-09-08 01:10:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:35,825 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-09-08 01:10:35,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 01:10:35,826 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2019-09-08 01:10:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:35,827 INFO L225 Difference]: With dead ends: 111 [2019-09-08 01:10:35,827 INFO L226 Difference]: Without dead ends: 106 [2019-09-08 01:10:35,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 01:10:35,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-08 01:10:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-08 01:10:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-08 01:10:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-08 01:10:35,832 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-08 01:10:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:35,832 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-08 01:10:35,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-08 01:10:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-08 01:10:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 01:10:35,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:35,834 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:35,834 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2132374173, now seen corresponding path program 47 times [2019-09-08 01:10:35,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:35,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:35,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:36,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:36,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:36,853 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:36,952 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-08 01:10:36,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:36,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 01:10:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:36,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:36,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-08 01:10:36,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-08 01:10:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-08 01:10:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:10:36,990 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2019-09-08 01:10:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:37,143 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-09-08 01:10:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 01:10:37,144 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-08 01:10:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:37,145 INFO L225 Difference]: With dead ends: 113 [2019-09-08 01:10:37,146 INFO L226 Difference]: Without dead ends: 108 [2019-09-08 01:10:37,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 01:10:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-08 01:10:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-08 01:10:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-08 01:10:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-08 01:10:37,151 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-08 01:10:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:37,152 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-08 01:10:37,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-08 01:10:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-08 01:10:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 01:10:37,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:37,153 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:37,153 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1647540827, now seen corresponding path program 48 times [2019-09-08 01:10:37,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:37,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:37,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:37,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:38,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:38,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:38,582 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-08 01:10:38,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:38,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 01:10:38,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:38,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:38,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-08 01:10:38,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-08 01:10:38,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-08 01:10:38,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:10:38,614 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2019-09-08 01:10:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:38,779 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-09-08 01:10:38,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 01:10:38,779 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-09-08 01:10:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:38,780 INFO L225 Difference]: With dead ends: 115 [2019-09-08 01:10:38,780 INFO L226 Difference]: Without dead ends: 110 [2019-09-08 01:10:38,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 01:10:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-08 01:10:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-08 01:10:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-08 01:10:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-08 01:10:38,786 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-08 01:10:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:38,786 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-08 01:10:38,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-08 01:10:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-08 01:10:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 01:10:38,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:38,787 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:38,787 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:38,788 INFO L82 PathProgramCache]: Analyzing trace with hash -420836711, now seen corresponding path program 49 times [2019-09-08 01:10:38,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:38,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:38,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:38,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:38,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:39,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:39,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:39,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:39,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 01:10:39,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:39,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:39,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-08 01:10:39,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-08 01:10:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-08 01:10:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:10:39,969 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2019-09-08 01:10:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,179 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-09-08 01:10:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 01:10:40,179 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2019-09-08 01:10:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,181 INFO L225 Difference]: With dead ends: 117 [2019-09-08 01:10:40,181 INFO L226 Difference]: Without dead ends: 112 [2019-09-08 01:10:40,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:10:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-08 01:10:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-08 01:10:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-08 01:10:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-08 01:10:40,187 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-08 01:10:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,188 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-08 01:10:40,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-08 01:10:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-08 01:10:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 01:10:40,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,191 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,191 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash 438207319, now seen corresponding path program 50 times [2019-09-08 01:10:40,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:40,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:41,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:41,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:41,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:41,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:41,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 01:10:41,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:41,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-08 01:10:41,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-08 01:10:41,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-08 01:10:41,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:10:41,435 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2019-09-08 01:10:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:41,613 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-09-08 01:10:41,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 01:10:41,616 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2019-09-08 01:10:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:41,618 INFO L225 Difference]: With dead ends: 119 [2019-09-08 01:10:41,618 INFO L226 Difference]: Without dead ends: 114 [2019-09-08 01:10:41,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 01:10:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-08 01:10:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-08 01:10:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-08 01:10:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-08 01:10:41,623 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-08 01:10:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:41,623 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-08 01:10:41,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-08 01:10:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-08 01:10:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 01:10:41,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:41,624 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:41,625 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1345799317, now seen corresponding path program 51 times [2019-09-08 01:10:41,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:41,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:42,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:42,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:42,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:42,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-08 01:10:42,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:42,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 01:10:42,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:42,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:42,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-08 01:10:42,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-08 01:10:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-08 01:10:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:10:42,821 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2019-09-08 01:10:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:43,024 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-09-08 01:10:43,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 01:10:43,024 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-08 01:10:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:43,026 INFO L225 Difference]: With dead ends: 121 [2019-09-08 01:10:43,026 INFO L226 Difference]: Without dead ends: 116 [2019-09-08 01:10:43,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 01:10:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-08 01:10:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-08 01:10:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-08 01:10:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-08 01:10:43,030 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-08 01:10:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:43,031 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-08 01:10:43,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-08 01:10:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-08 01:10:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 01:10:43,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:43,032 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:43,032 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:43,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1663348307, now seen corresponding path program 52 times [2019-09-08 01:10:43,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:43,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:43,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:43,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:43,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:44,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:44,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:44,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:44,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:44,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-08 01:10:44,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:44,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-08 01:10:44,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-08 01:10:44,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-08 01:10:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:10:44,606 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2019-09-08 01:10:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:44,771 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-09-08 01:10:44,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 01:10:44,772 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-09-08 01:10:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:44,773 INFO L225 Difference]: With dead ends: 123 [2019-09-08 01:10:44,773 INFO L226 Difference]: Without dead ends: 118 [2019-09-08 01:10:44,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 01:10:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-08 01:10:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-08 01:10:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-08 01:10:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-08 01:10:44,779 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-08 01:10:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:44,779 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-08 01:10:44,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-08 01:10:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-08 01:10:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 01:10:44,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:44,780 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:44,781 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:44,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1885249681, now seen corresponding path program 53 times [2019-09-08 01:10:44,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:44,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:44,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:44,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:45,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:45,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:45,920 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:46,031 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-08 01:10:46,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:46,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-08 01:10:46,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (54)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:46,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:46,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-08 01:10:46,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-08 01:10:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-08 01:10:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:10:46,068 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2019-09-08 01:10:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:46,254 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-09-08 01:10:46,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 01:10:46,255 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-09-08 01:10:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:46,256 INFO L225 Difference]: With dead ends: 125 [2019-09-08 01:10:46,256 INFO L226 Difference]: Without dead ends: 120 [2019-09-08 01:10:46,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 01:10:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-08 01:10:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-08 01:10:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-08 01:10:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-08 01:10:46,259 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-08 01:10:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:46,260 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-08 01:10:46,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-08 01:10:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-08 01:10:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 01:10:46,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:46,261 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:46,261 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:46,261 INFO L82 PathProgramCache]: Analyzing trace with hash 384105295, now seen corresponding path program 54 times [2019-09-08 01:10:46,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:46,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:46,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:46,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:46,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:47,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:47,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:47,446 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:47,560 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-08 01:10:47,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:47,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 01:10:47,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:47,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:47,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-08 01:10:47,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-08 01:10:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-08 01:10:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:10:47,594 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2019-09-08 01:10:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:47,802 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-09-08 01:10:47,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 01:10:47,803 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-08 01:10:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:47,804 INFO L225 Difference]: With dead ends: 127 [2019-09-08 01:10:47,804 INFO L226 Difference]: Without dead ends: 122 [2019-09-08 01:10:47,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 01:10:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-08 01:10:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-08 01:10:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-08 01:10:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-08 01:10:47,809 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-08 01:10:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:47,810 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-08 01:10:47,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-08 01:10:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-08 01:10:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 01:10:47,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:47,811 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:47,811 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:47,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash 893361805, now seen corresponding path program 55 times [2019-09-08 01:10:47,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:47,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:47,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:49,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:49,841 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) [2019-09-08 01:10:49,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:49,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-08 01:10:49,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:49,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:49,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-08 01:10:49,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-08 01:10:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-08 01:10:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:10:49,948 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2019-09-08 01:10:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:50,096 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-09-08 01:10:50,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 01:10:50,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-08 01:10:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:50,098 INFO L225 Difference]: With dead ends: 129 [2019-09-08 01:10:50,098 INFO L226 Difference]: Without dead ends: 124 [2019-09-08 01:10:50,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 01:10:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-08 01:10:50,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-08 01:10:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-08 01:10:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-08 01:10:50,103 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-08 01:10:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:50,104 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-08 01:10:50,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-08 01:10:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-08 01:10:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 01:10:50,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:50,105 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:50,105 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash 662596171, now seen corresponding path program 56 times [2019-09-08 01:10:50,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:51,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:51,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:51,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:51,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:51,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:51,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-08 01:10:51,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:51,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:51,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-08 01:10:51,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-08 01:10:51,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-08 01:10:51,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:10:51,813 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2019-09-08 01:10:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:51,979 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-09-08 01:10:51,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 01:10:51,980 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2019-09-08 01:10:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:51,981 INFO L225 Difference]: With dead ends: 131 [2019-09-08 01:10:51,981 INFO L226 Difference]: Without dead ends: 126 [2019-09-08 01:10:51,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 01:10:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-08 01:10:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-08 01:10:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-08 01:10:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-08 01:10:51,986 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-08 01:10:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:51,986 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-08 01:10:51,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-08 01:10:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-08 01:10:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 01:10:51,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:51,988 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:51,988 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2059846007, now seen corresponding path program 57 times [2019-09-08 01:10:51,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:51,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:51,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:53,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:53,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:53,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:53,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-08 01:10:53,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:53,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-08 01:10:53,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:53,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:53,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-08 01:10:53,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-08 01:10:53,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-08 01:10:53,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:10:53,497 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2019-09-08 01:10:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:53,701 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-09-08 01:10:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 01:10:53,702 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2019-09-08 01:10:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:53,703 INFO L225 Difference]: With dead ends: 133 [2019-09-08 01:10:53,703 INFO L226 Difference]: Without dead ends: 128 [2019-09-08 01:10:53,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 01:10:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-08 01:10:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-08 01:10:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-08 01:10:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-08 01:10:53,707 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-08 01:10:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:53,708 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-08 01:10:53,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-08 01:10:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-08 01:10:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 01:10:53,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:53,710 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:53,710 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1603271495, now seen corresponding path program 58 times [2019-09-08 01:10:53,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:53,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:53,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:53,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:55,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:55,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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:55,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:55,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:55,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 01:10:55,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:55,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:55,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-08 01:10:55,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-08 01:10:55,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-08 01:10:55,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:10:55,660 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2019-09-08 01:10:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:55,873 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-09-08 01:10:55,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 01:10:55,874 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2019-09-08 01:10:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:55,876 INFO L225 Difference]: With dead ends: 135 [2019-09-08 01:10:55,876 INFO L226 Difference]: Without dead ends: 130 [2019-09-08 01:10:55,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-08 01:10:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-08 01:10:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-08 01:10:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-08 01:10:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-09-08 01:10:55,883 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-09-08 01:10:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:55,884 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-09-08 01:10:55,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-08 01:10:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-09-08 01:10:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 01:10:55,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:55,885 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:55,885 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash -13991803, now seen corresponding path program 59 times [2019-09-08 01:10:55,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:55,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:55,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:55,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:57,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:57,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:57,545 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:57,668 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-08 01:10:57,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:57,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-08 01:10:57,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:57,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:57,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-08 01:10:57,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 01:10:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 01:10:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:10:57,697 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2019-09-08 01:10:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:57,893 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-09-08 01:10:57,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-08 01:10:57,893 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2019-09-08 01:10:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:57,894 INFO L225 Difference]: With dead ends: 137 [2019-09-08 01:10:57,894 INFO L226 Difference]: Without dead ends: 132 [2019-09-08 01:10:57,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 01:10:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-08 01:10:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-08 01:10:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-08 01:10:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-09-08 01:10:57,898 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-09-08 01:10:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:57,899 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-09-08 01:10:57,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 01:10:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-09-08 01:10:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 01:10:57,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:57,900 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:57,900 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash 574139971, now seen corresponding path program 60 times [2019-09-08 01:10:57,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:57,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:57,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:59,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:59,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:59,400 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:10:59,530 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-08 01:10:59,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:59,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-08 01:10:59,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-08 01:10:59,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-08 01:10:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-08 01:10:59,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:10:59,569 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2019-09-08 01:10:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:59,762 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-09-08 01:10:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 01:10:59,763 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2019-09-08 01:10:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:59,764 INFO L225 Difference]: With dead ends: 139 [2019-09-08 01:10:59,764 INFO L226 Difference]: Without dead ends: 134 [2019-09-08 01:10:59,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 01:10:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-08 01:10:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-08 01:10:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-08 01:10:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-08 01:10:59,769 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-09-08 01:10:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:59,769 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-08 01:10:59,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-08 01:10:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-08 01:10:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 01:10:59,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:59,770 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:59,770 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:59,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1166908287, now seen corresponding path program 61 times [2019-09-08 01:10:59,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:59,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:59,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:59,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:01,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:01,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:01,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:01,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 01:11:01,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:01,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:01,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-08 01:11:01,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-08 01:11:01,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-08 01:11:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:11:01,345 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2019-09-08 01:11:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:01,547 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-09-08 01:11:01,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 01:11:01,549 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2019-09-08 01:11:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:01,550 INFO L225 Difference]: With dead ends: 141 [2019-09-08 01:11:01,550 INFO L226 Difference]: Without dead ends: 136 [2019-09-08 01:11:01,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 01:11:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-08 01:11:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-08 01:11:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-08 01:11:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-09-08 01:11:01,554 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-09-08 01:11:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:01,555 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-09-08 01:11:01,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-08 01:11:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-09-08 01:11:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 01:11:01,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:01,558 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:01,559 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash 722961215, now seen corresponding path program 62 times [2019-09-08 01:11:01,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:01,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:01,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:01,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:03,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:03,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:03,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:03,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:03,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:03,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 01:11:03,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:03,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:03,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-08 01:11:03,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-08 01:11:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-08 01:11:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:11:03,244 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2019-09-08 01:11:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:03,489 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-09-08 01:11:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 01:11:03,494 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2019-09-08 01:11:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:03,495 INFO L225 Difference]: With dead ends: 143 [2019-09-08 01:11:03,495 INFO L226 Difference]: Without dead ends: 138 [2019-09-08 01:11:03,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 01:11:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-08 01:11:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-08 01:11:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-08 01:11:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-09-08 01:11:03,500 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-09-08 01:11:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:03,501 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-09-08 01:11:03,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-08 01:11:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-09-08 01:11:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 01:11:03,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:03,502 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:03,502 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:03,503 INFO L82 PathProgramCache]: Analyzing trace with hash 116386429, now seen corresponding path program 63 times [2019-09-08 01:11:03,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:03,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:03,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:03,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:03,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:05,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:05,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:05,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:05,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-08 01:11:05,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:05,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 01:11:05,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:05,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:05,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-08 01:11:05,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-08 01:11:05,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-08 01:11:05,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:11:05,335 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2019-09-08 01:11:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:05,564 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-09-08 01:11:05,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 01:11:05,564 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2019-09-08 01:11:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:05,565 INFO L225 Difference]: With dead ends: 145 [2019-09-08 01:11:05,566 INFO L226 Difference]: Without dead ends: 140 [2019-09-08 01:11:05,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 01:11:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-08 01:11:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-08 01:11:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-08 01:11:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-08 01:11:05,571 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-09-08 01:11:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:05,572 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-08 01:11:05,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-08 01:11:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-08 01:11:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 01:11:05,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:05,573 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:05,573 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1313569339, now seen corresponding path program 64 times [2019-09-08 01:11:05,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:05,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:05,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:07,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:07,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:07,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:07,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:07,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:07,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-08 01:11:07,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:07,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:07,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-08 01:11:07,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-08 01:11:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-08 01:11:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:11:07,306 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2019-09-08 01:11:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:07,562 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-08 01:11:07,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 01:11:07,563 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2019-09-08 01:11:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:07,564 INFO L225 Difference]: With dead ends: 147 [2019-09-08 01:11:07,564 INFO L226 Difference]: Without dead ends: 142 [2019-09-08 01:11:07,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 01:11:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-08 01:11:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-08 01:11:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-08 01:11:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-09-08 01:11:07,567 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-09-08 01:11:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:07,568 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-09-08 01:11:07,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-08 01:11:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-09-08 01:11:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 01:11:07,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:07,569 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:07,569 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash 755110521, now seen corresponding path program 65 times [2019-09-08 01:11:07,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:07,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:07,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:07,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:09,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:09,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:09,414 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-09-08 01:11:09,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:09,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 01:11:09,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:09,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:09,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-08 01:11:09,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-08 01:11:09,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-08 01:11:09,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:11:09,458 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2019-09-08 01:11:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:09,666 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-08 01:11:09,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-08 01:11:09,667 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2019-09-08 01:11:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:09,668 INFO L225 Difference]: With dead ends: 149 [2019-09-08 01:11:09,668 INFO L226 Difference]: Without dead ends: 144 [2019-09-08 01:11:09,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 01:11:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-08 01:11:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-08 01:11:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 01:11:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-09-08 01:11:09,672 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-09-08 01:11:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:09,673 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-09-08 01:11:09,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-08 01:11:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-09-08 01:11:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 01:11:09,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:09,674 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:09,674 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:09,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash 947098423, now seen corresponding path program 66 times [2019-09-08 01:11:09,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:09,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:09,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:09,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:11,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:11,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:11,358 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:11,503 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-08 01:11:11,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:11,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 01:11:11,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (67)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:11,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:11,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-08 01:11:11,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-08 01:11:11,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-08 01:11:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:11:11,545 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2019-09-08 01:11:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:11,789 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-08 01:11:11,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 01:11:11,789 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2019-09-08 01:11:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:11,791 INFO L225 Difference]: With dead ends: 151 [2019-09-08 01:11:11,791 INFO L226 Difference]: Without dead ends: 146 [2019-09-08 01:11:11,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 01:11:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-08 01:11:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-08 01:11:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-08 01:11:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-09-08 01:11:11,797 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-09-08 01:11:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:11,797 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-09-08 01:11:11,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-08 01:11:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-09-08 01:11:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 01:11:11,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:11,799 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:11,799 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash 763878517, now seen corresponding path program 67 times [2019-09-08 01:11:11,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:11,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:11,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:11,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:11,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:13,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:13,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:13,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:13,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-08 01:11:13,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:13,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:13,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-08 01:11:13,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-08 01:11:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-08 01:11:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:11:13,634 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 70 states. [2019-09-08 01:11:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:13,894 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-08 01:11:13,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 01:11:13,894 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2019-09-08 01:11:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:13,895 INFO L225 Difference]: With dead ends: 153 [2019-09-08 01:11:13,895 INFO L226 Difference]: Without dead ends: 148 [2019-09-08 01:11:13,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 01:11:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-08 01:11:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-09-08 01:11:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-08 01:11:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-09-08 01:11:13,900 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-09-08 01:11:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:13,901 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-09-08 01:11:13,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-08 01:11:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-09-08 01:11:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 01:11:13,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:13,902 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:13,902 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 783207987, now seen corresponding path program 68 times [2019-09-08 01:11:13,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:13,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:15,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:15,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:15,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:15,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:15,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:15,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-08 01:11:15,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:15,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:15,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-08 01:11:15,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-08 01:11:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-08 01:11:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:11:15,816 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2019-09-08 01:11:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:16,083 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-08 01:11:16,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 01:11:16,084 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2019-09-08 01:11:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:16,085 INFO L225 Difference]: With dead ends: 155 [2019-09-08 01:11:16,085 INFO L226 Difference]: Without dead ends: 150 [2019-09-08 01:11:16,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 01:11:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-08 01:11:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-08 01:11:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-08 01:11:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-09-08 01:11:16,090 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-09-08 01:11:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:16,090 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-09-08 01:11:16,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-08 01:11:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-09-08 01:11:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 01:11:16,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:16,091 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:16,092 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2116007823, now seen corresponding path program 69 times [2019-09-08 01:11:16,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:16,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:16,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:16,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:17,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:17,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:17,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:18,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-08 01:11:18,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:18,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 01:11:18,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:18,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-08 01:11:18,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-08 01:11:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-08 01:11:18,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:11:18,091 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 72 states. [2019-09-08 01:11:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:18,306 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-08 01:11:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-08 01:11:18,306 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2019-09-08 01:11:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:18,307 INFO L225 Difference]: With dead ends: 157 [2019-09-08 01:11:18,307 INFO L226 Difference]: Without dead ends: 152 [2019-09-08 01:11:18,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-08 01:11:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-08 01:11:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-08 01:11:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-08 01:11:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-09-08 01:11:18,311 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-09-08 01:11:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:18,312 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-09-08 01:11:18,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-08 01:11:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-09-08 01:11:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 01:11:18,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:18,313 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:18,313 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash -828626129, now seen corresponding path program 70 times [2019-09-08 01:11:18,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:18,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:18,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:18,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:20,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:20,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:20,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:20,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:20,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 01:11:20,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:20,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:20,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-08 01:11:20,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-08 01:11:20,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-08 01:11:20,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:11:20,312 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2019-09-08 01:11:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:20,504 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-08 01:11:20,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 01:11:20,505 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2019-09-08 01:11:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:20,506 INFO L225 Difference]: With dead ends: 159 [2019-09-08 01:11:20,507 INFO L226 Difference]: Without dead ends: 154 [2019-09-08 01:11:20,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 01:11:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-08 01:11:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-08 01:11:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-08 01:11:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-09-08 01:11:20,512 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-09-08 01:11:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:20,512 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-09-08 01:11:20,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-08 01:11:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-09-08 01:11:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 01:11:20,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:20,514 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:20,514 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash -605399443, now seen corresponding path program 71 times [2019-09-08 01:11:20,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:20,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:20,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:20,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:20,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:23,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:23,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:23,097 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:23,249 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-08 01:11:23,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:23,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-08 01:11:23,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (72)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:11:23,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:23,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-09-08 01:11:23,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-08 01:11:23,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-08 01:11:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:11:23,301 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 74 states. [2019-09-08 01:11:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:23,607 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-08 01:11:23,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-08 01:11:23,608 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-08 01:11:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:23,609 INFO L225 Difference]: With dead ends: 161 [2019-09-08 01:11:23,609 INFO L226 Difference]: Without dead ends: 156 [2019-09-08 01:11:23,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 01:11:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-08 01:11:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-08 01:11:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-08 01:11:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-09-08 01:11:23,614 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-09-08 01:11:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:23,614 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-09-08 01:11:23,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-08 01:11:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-09-08 01:11:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 01:11:23,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:23,615 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:23,615 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash -832918997, now seen corresponding path program 72 times [2019-09-08 01:11:23,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:23,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:23,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:27,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:27,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:11:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:27,378 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-08 01:11:27,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:27,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-08 01:11:27,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:27,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:27,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-09-08 01:11:27,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-08 01:11:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-08 01:11:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:11:27,412 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2019-09-08 01:11:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:27,702 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-08 01:11:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 01:11:27,703 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2019-09-08 01:11:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:27,703 INFO L225 Difference]: With dead ends: 163 [2019-09-08 01:11:27,704 INFO L226 Difference]: Without dead ends: 158 [2019-09-08 01:11:27,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 01:11:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-08 01:11:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-08 01:11:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-08 01:11:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-09-08 01:11:27,708 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-09-08 01:11:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:27,708 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-09-08 01:11:27,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-08 01:11:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-09-08 01:11:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 01:11:27,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:27,709 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:27,709 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash -435878295, now seen corresponding path program 73 times [2019-09-08 01:11:27,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:27,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:27,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:27,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:27,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:30,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:30,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:30,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:30,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-08 01:11:30,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:30,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:30,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-09-08 01:11:30,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-08 01:11:30,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-08 01:11:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:11:30,135 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 76 states. [2019-09-08 01:11:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:30,431 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-08 01:11:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-08 01:11:30,431 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2019-09-08 01:11:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:30,432 INFO L225 Difference]: With dead ends: 165 [2019-09-08 01:11:30,432 INFO L226 Difference]: Without dead ends: 160 [2019-09-08 01:11:30,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 01:11:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-08 01:11:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-08 01:11:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-08 01:11:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-09-08 01:11:30,437 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-09-08 01:11:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:30,437 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-09-08 01:11:30,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-08 01:11:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-09-08 01:11:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 01:11:30,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:30,438 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:30,439 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:30,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:30,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1131853017, now seen corresponding path program 74 times [2019-09-08 01:11:30,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:30,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:30,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:32,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:32,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:32,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:32,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:32,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:32,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 01:11:32,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (75)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:32,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:32,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-09-08 01:11:32,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-08 01:11:32,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-08 01:11:32,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:11:32,621 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2019-09-08 01:11:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:32,924 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-08 01:11:32,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 01:11:32,925 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2019-09-08 01:11:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:32,926 INFO L225 Difference]: With dead ends: 167 [2019-09-08 01:11:32,926 INFO L226 Difference]: Without dead ends: 162 [2019-09-08 01:11:32,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-08 01:11:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-08 01:11:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-08 01:11:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-08 01:11:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-09-08 01:11:32,930 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-09-08 01:11:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:32,930 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-09-08 01:11:32,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-08 01:11:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-09-08 01:11:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 01:11:32,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:32,932 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:32,932 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:32,932 INFO L82 PathProgramCache]: Analyzing trace with hash 51337317, now seen corresponding path program 75 times [2019-09-08 01:11:32,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:32,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:32,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:32,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:32,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:34,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:34,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:34,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:35,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-09-08 01:11:35,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:35,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-08 01:11:35,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (76)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:11:35,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:35,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-09-08 01:11:35,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-08 01:11:35,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-08 01:11:35,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:11:35,178 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 78 states. [2019-09-08 01:11:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:35,471 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-08 01:11:35,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 01:11:35,471 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-08 01:11:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:35,475 INFO L225 Difference]: With dead ends: 169 [2019-09-08 01:11:35,476 INFO L226 Difference]: Without dead ends: 164 [2019-09-08 01:11:35,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 01:11:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-08 01:11:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-08 01:11:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-08 01:11:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-09-08 01:11:35,480 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-09-08 01:11:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:35,481 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-09-08 01:11:35,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-08 01:11:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-09-08 01:11:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 01:11:35,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:35,482 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:35,482 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:35,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1069085149, now seen corresponding path program 76 times [2019-09-08 01:11:35,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:35,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:37,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:37,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:37,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:37,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:37,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:37,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-08 01:11:37,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:37,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:37,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-09-08 01:11:37,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-08 01:11:37,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-08 01:11:37,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:11:37,702 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2019-09-08 01:11:38,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:38,003 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-08 01:11:38,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-08 01:11:38,003 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2019-09-08 01:11:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:38,005 INFO L225 Difference]: With dead ends: 171 [2019-09-08 01:11:38,005 INFO L226 Difference]: Without dead ends: 166 [2019-09-08 01:11:38,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 01:11:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-08 01:11:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-08 01:11:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-08 01:11:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-09-08 01:11:38,010 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-09-08 01:11:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:38,011 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-09-08 01:11:38,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-08 01:11:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-09-08 01:11:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 01:11:38,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:38,012 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:38,012 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash 241716321, now seen corresponding path program 77 times [2019-09-08 01:11:38,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:38,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:38,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:38,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:38,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:40,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:40,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:40,226 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:40,389 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-08 01:11:40,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:40,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 01:11:40,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:40,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:40,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-09-08 01:11:40,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-08 01:11:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-08 01:11:40,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:11:40,436 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 80 states. [2019-09-08 01:11:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:40,716 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-08 01:11:40,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-08 01:11:40,717 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2019-09-08 01:11:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:40,718 INFO L225 Difference]: With dead ends: 173 [2019-09-08 01:11:40,718 INFO L226 Difference]: Without dead ends: 168 [2019-09-08 01:11:40,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 01:11:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-08 01:11:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-08 01:11:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-08 01:11:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-09-08 01:11:40,723 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-09-08 01:11:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:40,724 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-09-08 01:11:40,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-08 01:11:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-09-08 01:11:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 01:11:40,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:40,725 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:40,725 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1496511263, now seen corresponding path program 78 times [2019-09-08 01:11:40,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:40,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:40,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:42,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:42,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:42,938 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:11:43,103 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-08 01:11:43,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:43,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 01:11:43,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:43,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:43,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-09-08 01:11:43,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-08 01:11:43,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-08 01:11:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:11:43,147 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2019-09-08 01:11:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:43,472 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-08 01:11:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 01:11:43,472 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2019-09-08 01:11:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:43,473 INFO L225 Difference]: With dead ends: 175 [2019-09-08 01:11:43,473 INFO L226 Difference]: Without dead ends: 170 [2019-09-08 01:11:43,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 01:11:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-08 01:11:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-08 01:11:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-08 01:11:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-09-08 01:11:43,479 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-09-08 01:11:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:43,480 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-09-08 01:11:43,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-08 01:11:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-09-08 01:11:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 01:11:43,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:43,480 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:43,481 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:43,481 INFO L82 PathProgramCache]: Analyzing trace with hash 468640349, now seen corresponding path program 79 times [2019-09-08 01:11:43,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:43,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:43,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:43,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:43,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:45,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:45,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:45,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:45,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-08 01:11:45,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:45,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:45,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-09-08 01:11:45,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-08 01:11:45,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-08 01:11:45,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:11:45,852 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 82 states. [2019-09-08 01:11:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:46,140 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-08 01:11:46,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-08 01:11:46,141 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-08 01:11:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:46,142 INFO L225 Difference]: With dead ends: 177 [2019-09-08 01:11:46,142 INFO L226 Difference]: Without dead ends: 172 [2019-09-08 01:11:46,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 01:11:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-08 01:11:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-08 01:11:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-08 01:11:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-09-08 01:11:46,147 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-09-08 01:11:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:46,148 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-09-08 01:11:46,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-08 01:11:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-09-08 01:11:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 01:11:46,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:46,149 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:46,149 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash 527170075, now seen corresponding path program 80 times [2019-09-08 01:11:46,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:46,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:46,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:11:46,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:48,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:48,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:48,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:11:48,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:11:48,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:48,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-08 01:11:48,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-09-08 01:11:48,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-08 01:11:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-08 01:11:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:11:48,577 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2019-09-08 01:11:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:48,866 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-08 01:11:48,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-08 01:11:48,867 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2019-09-08 01:11:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:48,868 INFO L225 Difference]: With dead ends: 179 [2019-09-08 01:11:48,868 INFO L226 Difference]: Without dead ends: 174 [2019-09-08 01:11:48,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-08 01:11:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-08 01:11:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-08 01:11:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-08 01:11:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-09-08 01:11:48,873 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-09-08 01:11:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:48,874 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-09-08 01:11:48,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-08 01:11:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-09-08 01:11:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 01:11:48,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:48,875 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:48,875 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:48,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash 939661913, now seen corresponding path program 81 times [2019-09-08 01:11:48,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:48,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:48,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:48,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:48,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:51,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:51,479 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:51,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:11:51,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-08 01:11:51,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:51,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 01:11:51,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:51,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:51,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-09-08 01:11:51,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-08 01:11:51,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-08 01:11:51,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:11:51,711 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 84 states. [2019-09-08 01:11:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:52,068 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-08 01:11:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 01:11:52,068 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2019-09-08 01:11:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:52,069 INFO L225 Difference]: With dead ends: 181 [2019-09-08 01:11:52,069 INFO L226 Difference]: Without dead ends: 176 [2019-09-08 01:11:52,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-08 01:11:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-08 01:11:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-08 01:11:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-08 01:11:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-09-08 01:11:52,074 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-09-08 01:11:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:52,074 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-09-08 01:11:52,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-08 01:11:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-09-08 01:11:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 01:11:52,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:52,076 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:52,076 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2087640297, now seen corresponding path program 82 times [2019-09-08 01:11:52,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:52,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:54,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:54,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:54,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:11:54,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:11:54,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:54,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 01:11:54,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:54,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:54,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-09-08 01:11:54,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-08 01:11:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-08 01:11:54,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:11:54,666 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2019-09-08 01:11:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:55,020 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-08 01:11:55,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-08 01:11:55,020 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2019-09-08 01:11:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:55,021 INFO L225 Difference]: With dead ends: 183 [2019-09-08 01:11:55,021 INFO L226 Difference]: Without dead ends: 178 [2019-09-08 01:11:55,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-09-08 01:11:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-08 01:11:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-08 01:11:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-08 01:11:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-09-08 01:11:55,025 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-09-08 01:11:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:55,025 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-09-08 01:11:55,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-08 01:11:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-09-08 01:11:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 01:11:55,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:55,028 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:55,029 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash 662762581, now seen corresponding path program 83 times [2019-09-08 01:11:55,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:55,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:55,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:11:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:57,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:11:57,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:11:57,545 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:11:57,733 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-08 01:11:57,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:11:57,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-08 01:11:57,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:11:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:11:57,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:11:57,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-09-08 01:11:57,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-08 01:11:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-08 01:11:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:11:57,785 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 86 states. [2019-09-08 01:11:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:11:58,137 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-08 01:11:58,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-08 01:11:58,137 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2019-09-08 01:11:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:11:58,138 INFO L225 Difference]: With dead ends: 185 [2019-09-08 01:11:58,138 INFO L226 Difference]: Without dead ends: 180 [2019-09-08 01:11:58,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 01:11:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-08 01:11:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-08 01:11:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-08 01:11:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-09-08 01:11:58,143 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-09-08 01:11:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:11:58,143 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-09-08 01:11:58,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-08 01:11:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-09-08 01:11:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 01:11:58,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:11:58,145 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:11:58,145 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:11:58,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:11:58,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1899925997, now seen corresponding path program 84 times [2019-09-08 01:11:58,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:11:58,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:11:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:58,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:11:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:11:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:00,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:00,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:00,707 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:00,898 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-08 01:12:00,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:00,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-08 01:12:00,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:00,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:00,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-09-08 01:12:00,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-08 01:12:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-08 01:12:00,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:12:00,937 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2019-09-08 01:12:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:01,240 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-08 01:12:01,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 01:12:01,241 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2019-09-08 01:12:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:01,242 INFO L225 Difference]: With dead ends: 187 [2019-09-08 01:12:01,242 INFO L226 Difference]: Without dead ends: 182 [2019-09-08 01:12:01,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-08 01:12:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-08 01:12:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-08 01:12:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-08 01:12:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-09-08 01:12:01,246 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-09-08 01:12:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:01,246 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-09-08 01:12:01,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-08 01:12:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-09-08 01:12:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 01:12:01,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:01,248 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:01,248 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:01,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:01,248 INFO L82 PathProgramCache]: Analyzing trace with hash 667578449, now seen corresponding path program 85 times [2019-09-08 01:12:01,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:01,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:01,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:01,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:01,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:03,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:03,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:03,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:03,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-08 01:12:03,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:03,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-09-08 01:12:03,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-08 01:12:03,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-08 01:12:03,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:12:03,946 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 88 states. [2019-09-08 01:12:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:04,292 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-08 01:12:04,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-08 01:12:04,292 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2019-09-08 01:12:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:04,293 INFO L225 Difference]: With dead ends: 189 [2019-09-08 01:12:04,293 INFO L226 Difference]: Without dead ends: 184 [2019-09-08 01:12:04,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 01:12:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-08 01:12:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-08 01:12:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-08 01:12:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-09-08 01:12:04,296 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-09-08 01:12:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:04,297 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2019-09-08 01:12:04,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-08 01:12:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2019-09-08 01:12:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 01:12:04,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:04,298 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:04,298 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1566844145, now seen corresponding path program 86 times [2019-09-08 01:12:04,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:04,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:04,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:06,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:06,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:06,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:07,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:07,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:07,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-08 01:12:07,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:07,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:07,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-09-08 01:12:07,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-08 01:12:07,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-08 01:12:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:12:07,081 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2019-09-08 01:12:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:07,400 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-08 01:12:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 01:12:07,400 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2019-09-08 01:12:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:07,402 INFO L225 Difference]: With dead ends: 191 [2019-09-08 01:12:07,402 INFO L226 Difference]: Without dead ends: 186 [2019-09-08 01:12:07,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-09-08 01:12:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-08 01:12:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-08 01:12:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-08 01:12:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-09-08 01:12:07,407 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-09-08 01:12:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:07,407 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-09-08 01:12:07,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-08 01:12:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-09-08 01:12:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 01:12:07,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:07,409 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:07,409 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1363308979, now seen corresponding path program 87 times [2019-09-08 01:12:07,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:07,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:07,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:07,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:07,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:10,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:10,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:10,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:10,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-08 01:12:10,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:10,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-08 01:12:10,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:10,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:10,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-09-08 01:12:10,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-08 01:12:10,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-08 01:12:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:12:10,372 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 90 states. [2019-09-08 01:12:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:10,707 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-08 01:12:10,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-08 01:12:10,708 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2019-09-08 01:12:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:10,709 INFO L225 Difference]: With dead ends: 193 [2019-09-08 01:12:10,709 INFO L226 Difference]: Without dead ends: 188 [2019-09-08 01:12:10,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 01:12:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-08 01:12:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-08 01:12:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-08 01:12:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-09-08 01:12:10,713 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-09-08 01:12:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:10,713 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-09-08 01:12:10,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-08 01:12:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-09-08 01:12:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 01:12:10,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:10,715 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:10,715 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:10,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:10,715 INFO L82 PathProgramCache]: Analyzing trace with hash 960457227, now seen corresponding path program 88 times [2019-09-08 01:12:10,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:10,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:10,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:13,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:13,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:13,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:13,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:13,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:13,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-08 01:12:13,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:13,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:13,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-09-08 01:12:13,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-08 01:12:13,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-08 01:12:13,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:12:13,559 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states. [2019-09-08 01:12:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:13,963 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-08 01:12:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 01:12:13,964 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2019-09-08 01:12:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:13,965 INFO L225 Difference]: With dead ends: 195 [2019-09-08 01:12:13,965 INFO L226 Difference]: Without dead ends: 190 [2019-09-08 01:12:13,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 01:12:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-08 01:12:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-08 01:12:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-08 01:12:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-09-08 01:12:13,968 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-09-08 01:12:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:13,968 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-09-08 01:12:13,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-08 01:12:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-09-08 01:12:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 01:12:13,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:13,970 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:13,970 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash 716787273, now seen corresponding path program 89 times [2019-09-08 01:12:13,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:13,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:13,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:16,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:16,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:16,830 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:17,028 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-08 01:12:17,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:17,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-08 01:12:17,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:17,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:17,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-09-08 01:12:17,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-08 01:12:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-08 01:12:17,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:12:17,069 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 92 states. [2019-09-08 01:12:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:17,424 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-08 01:12:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-08 01:12:17,424 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2019-09-08 01:12:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:17,425 INFO L225 Difference]: With dead ends: 197 [2019-09-08 01:12:17,425 INFO L226 Difference]: Without dead ends: 192 [2019-09-08 01:12:17,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-08 01:12:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-08 01:12:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-08 01:12:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-08 01:12:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-09-08 01:12:17,429 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-09-08 01:12:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:17,429 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-09-08 01:12:17,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-08 01:12:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-09-08 01:12:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 01:12:17,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:17,430 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:17,430 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1521804537, now seen corresponding path program 90 times [2019-09-08 01:12:17,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:17,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:17,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:20,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:20,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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:20,279 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:20,498 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-09-08 01:12:20,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:20,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-08 01:12:20,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:20,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:20,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-09-08 01:12:20,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-08 01:12:20,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-08 01:12:20,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:12:20,537 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 93 states. [2019-09-08 01:12:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:20,855 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-08 01:12:20,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-08 01:12:20,856 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2019-09-08 01:12:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:20,857 INFO L225 Difference]: With dead ends: 199 [2019-09-08 01:12:20,857 INFO L226 Difference]: Without dead ends: 194 [2019-09-08 01:12:20,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 01:12:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-08 01:12:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-08 01:12:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-08 01:12:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-09-08 01:12:20,861 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-09-08 01:12:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:20,862 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-09-08 01:12:20,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-08 01:12:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-09-08 01:12:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 01:12:20,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:20,863 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:20,863 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:20,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:20,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1029918651, now seen corresponding path program 91 times [2019-09-08 01:12:20,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:20,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:20,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:23,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:23,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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:23,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:23,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-08 01:12:23,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:23,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:23,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-09-08 01:12:23,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-08 01:12:23,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-08 01:12:23,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:12:23,924 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 94 states. [2019-09-08 01:12:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:24,310 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-08 01:12:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-08 01:12:24,310 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 192 [2019-09-08 01:12:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:24,311 INFO L225 Difference]: With dead ends: 201 [2019-09-08 01:12:24,311 INFO L226 Difference]: Without dead ends: 196 [2019-09-08 01:12:24,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-08 01:12:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-08 01:12:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-08 01:12:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-08 01:12:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-09-08 01:12:24,314 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-09-08 01:12:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:24,314 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2019-09-08 01:12:24,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-08 01:12:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2019-09-08 01:12:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 01:12:24,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:24,315 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:24,315 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash -773984765, now seen corresponding path program 92 times [2019-09-08 01:12:24,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:24,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:24,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:27,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:27,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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:27,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:27,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:27,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:27,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-08 01:12:27,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:27,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:27,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-09-08 01:12:27,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-08 01:12:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-08 01:12:27,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:12:27,491 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 95 states. [2019-09-08 01:12:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:27,935 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-08 01:12:27,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-08 01:12:27,935 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2019-09-08 01:12:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:27,936 INFO L225 Difference]: With dead ends: 203 [2019-09-08 01:12:27,936 INFO L226 Difference]: Without dead ends: 198 [2019-09-08 01:12:27,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 01:12:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-08 01:12:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-08 01:12:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-08 01:12:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-09-08 01:12:27,942 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-09-08 01:12:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:27,942 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-09-08 01:12:27,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-08 01:12:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-09-08 01:12:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 01:12:27,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:27,944 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:27,944 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash 365343809, now seen corresponding path program 93 times [2019-09-08 01:12:27,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:27,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:27,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:31,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:31,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:31,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:31,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-08 01:12:31,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:31,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-08 01:12:31,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:31,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:31,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-09-08 01:12:31,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-08 01:12:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-08 01:12:31,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:12:31,290 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 96 states. [2019-09-08 01:12:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:31,757 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-08 01:12:31,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-08 01:12:31,757 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 196 [2019-09-08 01:12:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:31,758 INFO L225 Difference]: With dead ends: 205 [2019-09-08 01:12:31,758 INFO L226 Difference]: Without dead ends: 200 [2019-09-08 01:12:31,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 01:12:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-08 01:12:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-08 01:12:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 01:12:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-09-08 01:12:31,762 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-09-08 01:12:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:31,762 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-09-08 01:12:31,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-08 01:12:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-09-08 01:12:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 01:12:31,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:31,763 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:31,763 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:31,764 INFO L82 PathProgramCache]: Analyzing trace with hash 43442943, now seen corresponding path program 94 times [2019-09-08 01:12:31,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:31,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:31,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:31,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:31,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:34,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:34,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:34,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:12:34,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:12:34,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:34,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-08 01:12:34,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:34,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:34,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-09-08 01:12:34,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-08 01:12:35,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-08 01:12:35,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:12:35,000 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 97 states. [2019-09-08 01:12:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:35,449 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-08 01:12:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-08 01:12:35,450 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2019-09-08 01:12:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:35,451 INFO L225 Difference]: With dead ends: 207 [2019-09-08 01:12:35,451 INFO L226 Difference]: Without dead ends: 202 [2019-09-08 01:12:35,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 01:12:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-08 01:12:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-08 01:12:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-08 01:12:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-09-08 01:12:35,454 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-09-08 01:12:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:35,454 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-09-08 01:12:35,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-08 01:12:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-09-08 01:12:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 01:12:35,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:35,456 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:35,456 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash -65643971, now seen corresponding path program 95 times [2019-09-08 01:12:35,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:35,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:35,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:38,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:38,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:38,669 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:12:38,888 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-09-08 01:12:38,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:38,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-08 01:12:38,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:38,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:38,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-09-08 01:12:38,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-08 01:12:38,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-08 01:12:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:12:38,931 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 98 states. [2019-09-08 01:12:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:39,304 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-08 01:12:39,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-08 01:12:39,304 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 200 [2019-09-08 01:12:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:39,306 INFO L225 Difference]: With dead ends: 209 [2019-09-08 01:12:39,306 INFO L226 Difference]: Without dead ends: 204 [2019-09-08 01:12:39,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 01:12:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-08 01:12:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-08 01:12:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 01:12:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-09-08 01:12:39,310 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-09-08 01:12:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:39,311 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-09-08 01:12:39,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-08 01:12:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-09-08 01:12:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 01:12:39,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:39,312 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:39,312 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:39,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1818953221, now seen corresponding path program 96 times [2019-09-08 01:12:39,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:39,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:39,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:39,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:39,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:42,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:42,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:42,557 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:12:42,782 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-09-08 01:12:42,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:42,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-08 01:12:42,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:42,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:42,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-08 01:12:42,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-08 01:12:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-08 01:12:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:12:42,829 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 99 states. [2019-09-08 01:12:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:43,145 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-09-08 01:12:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 01:12:43,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2019-09-08 01:12:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:43,147 INFO L225 Difference]: With dead ends: 211 [2019-09-08 01:12:43,147 INFO L226 Difference]: Without dead ends: 206 [2019-09-08 01:12:43,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-08 01:12:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-08 01:12:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-08 01:12:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-08 01:12:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-09-08 01:12:43,152 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-09-08 01:12:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:43,153 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-09-08 01:12:43,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-08 01:12:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-09-08 01:12:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 01:12:43,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:43,154 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:43,154 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1173004857, now seen corresponding path program 97 times [2019-09-08 01:12:43,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:43,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:43,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:43,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:46,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:46,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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:46,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:46,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-08 01:12:46,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:46,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-09-08 01:12:46,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-08 01:12:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-08 01:12:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:12:46,568 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 100 states. [2019-09-08 01:12:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:47,008 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-09-08 01:12:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-08 01:12:47,008 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 204 [2019-09-08 01:12:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:47,009 INFO L225 Difference]: With dead ends: 213 [2019-09-08 01:12:47,009 INFO L226 Difference]: Without dead ends: 208 [2019-09-08 01:12:47,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-08 01:12:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-08 01:12:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-08 01:12:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-08 01:12:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-09-08 01:12:47,013 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2019-09-08 01:12:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:47,013 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-09-08 01:12:47,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-08 01:12:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-09-08 01:12:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 01:12:47,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:47,014 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:47,015 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1183370505, now seen corresponding path program 98 times [2019-09-08 01:12:47,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:47,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:12:47,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:50,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:50,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:50,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:12:50,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:12:50,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:50,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-08 01:12:50,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:50,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:50,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-09-08 01:12:50,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-08 01:12:50,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-08 01:12:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:12:50,570 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 101 states. [2019-09-08 01:12:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:50,933 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-09-08 01:12:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 01:12:50,933 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2019-09-08 01:12:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:50,934 INFO L225 Difference]: With dead ends: 215 [2019-09-08 01:12:50,934 INFO L226 Difference]: Without dead ends: 210 [2019-09-08 01:12:50,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 01:12:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-08 01:12:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-08 01:12:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-08 01:12:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-09-08 01:12:50,938 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2019-09-08 01:12:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:50,939 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-09-08 01:12:50,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-08 01:12:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-09-08 01:12:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 01:12:50,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:50,940 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:50,940 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:50,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2082638901, now seen corresponding path program 99 times [2019-09-08 01:12:50,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:50,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:50,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:50,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:12:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:54,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:12:54,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:12:54,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:12:54,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-09-08 01:12:54,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:12:54,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 01:12:54,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:12:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:12:54,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:12:54,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-09-08 01:12:54,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-08 01:12:54,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-08 01:12:54,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:12:54,752 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 102 states. [2019-09-08 01:12:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:12:55,218 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-09-08 01:12:55,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-08 01:12:55,218 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2019-09-08 01:12:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:12:55,220 INFO L225 Difference]: With dead ends: 216 [2019-09-08 01:12:55,220 INFO L226 Difference]: Without dead ends: 211 [2019-09-08 01:12:55,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-08 01:12:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-08 01:12:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-08 01:12:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-08 01:12:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-09-08 01:12:55,225 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2019-09-08 01:12:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:12:55,225 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-09-08 01:12:55,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-08 01:12:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-09-08 01:12:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 01:12:55,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:12:55,227 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:12:55,227 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:12:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:12:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1096584691, now seen corresponding path program 100 times [2019-09-08 01:12:55,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:12:55,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:12:55,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:55,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:12:55,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:12:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:12:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:12:55,326 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 01:12:55,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:12:55 BoogieIcfgContainer [2019-09-08 01:12:55,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:12:55,437 INFO L168 Benchmark]: Toolchain (without parser) took 168346.93 ms. Allocated memory was 135.8 MB in the beginning and 805.8 MB in the end (delta: 670.0 MB). Free memory was 91.6 MB in the beginning and 479.6 MB in the end (delta: -388.0 MB). Peak memory consumption was 282.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:55,437 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:12:55,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.04 ms. Allocated memory is still 135.8 MB. Free memory was 91.4 MB in the beginning and 82.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:55,437 INFO L168 Benchmark]: Boogie Preprocessor took 132.02 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 82.1 MB in the beginning and 178.5 MB in the end (delta: -96.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:55,438 INFO L168 Benchmark]: RCFGBuilder took 331.52 ms. Allocated memory is still 201.9 MB. Free memory was 178.5 MB in the beginning and 167.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:55,438 INFO L168 Benchmark]: TraceAbstraction took 167603.12 ms. Allocated memory was 201.9 MB in the beginning and 805.8 MB in the end (delta: 604.0 MB). Free memory was 166.9 MB in the beginning and 479.6 MB in the end (delta: -312.6 MB). Peak memory consumption was 291.4 MB. Max. memory is 7.1 GB. [2019-09-08 01:12:55,439 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.04 ms. Allocated memory is still 135.8 MB. Free memory was 91.4 MB in the beginning and 82.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.02 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 82.1 MB in the beginning and 178.5 MB in the end (delta: -96.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 331.52 ms. Allocated memory is still 201.9 MB. Free memory was 178.5 MB in the beginning and 167.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167603.12 ms. Allocated memory was 201.9 MB in the beginning and 805.8 MB in the end (delta: 604.0 MB). Free memory was 166.9 MB in the beginning and 479.6 MB in the end (delta: -312.6 MB). Peak memory consumption was 291.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 10]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 20. Possible FailurePath: [L14] double x0, x1, x2; [L15] int i; [L17] x0 = 11. / 2. [L18] x1 = 61. / 11. [L19] i = 0 VAL [i=0] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=0, x0=61, x1=22, x2=22] [L19] i++ VAL [i=1, x0=61, x1=22, x2=22] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=1, x0=22, x1=23, x2=23] [L19] i++ VAL [i=2, x0=22, x1=23, x2=23] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=2, x0=23, x1=21, x2=21] [L19] i++ VAL [i=3, x0=23, x1=21, x2=21] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=3, x0=21, x1=28, x2=28] [L19] i++ VAL [i=4, x0=21, x1=28, x2=28] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=4, x0=28, x1=25, x2=25] [L19] i++ VAL [i=5, x0=28, x1=25, x2=25] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=5, x0=25, x1=80, x2=80] [L19] i++ VAL [i=6, x0=25, x1=80, x2=80] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=6, x0=80, x1=79, x2=79] [L19] i++ VAL [i=7, x0=80, x1=79, x2=79] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=7, x0=79, x1=77, x2=77] [L19] i++ VAL [i=8, x0=79, x1=77, x2=77] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=8, x0=77, x1=70, x2=70] [L19] i++ VAL [i=9, x0=77, x1=70, x2=70] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=9, x0=70, x1=67, x2=67] [L19] i++ VAL [i=10, x0=70, x1=67, x2=67] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=10, x0=67, x1=65, x2=65] [L19] i++ VAL [i=11, x0=67, x1=65, x2=65] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=11, x0=65, x1=64, x2=64] [L19] i++ VAL [i=12, x0=65, x1=64, x2=64] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=12, x0=64, x1=63, x2=63] [L19] i++ VAL [i=13, x0=64, x1=63, x2=63] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=13, x0=63, x1=54, x2=54] [L19] i++ VAL [i=14, x0=63, x1=54, x2=54] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=14, x0=54, x1=52, x2=52] [L19] i++ VAL [i=15, x0=54, x1=52, x2=52] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=15, x0=52, x1=49, x2=49] [L19] i++ VAL [i=16, x0=52, x1=49, x2=49] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=16, x0=49, x1=101, x2=101] [L19] i++ VAL [i=17, x0=49, x1=101, x2=101] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=17, x0=101, x1=100, x2=100] [L19] i++ VAL [i=18, x0=101, x1=100, x2=100] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=18, x0=100, x1=97, x2=97] [L19] i++ VAL [i=19, x0=100, x1=97, x2=97] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=19, x0=97, x1=95, x2=95] [L19] i++ VAL [i=20, x0=97, x1=95, x2=95] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=20, x0=95, x1=93, x2=93] [L19] i++ VAL [i=21, x0=95, x1=93, x2=93] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=21, x0=93, x1=91, x2=91] [L19] i++ VAL [i=22, x0=93, x1=91, x2=91] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=22, x0=91, x1=90, x2=90] [L19] i++ VAL [i=23, x0=91, x1=90, x2=90] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=23, x0=90, x1=86, x2=86] [L19] i++ VAL [i=24, x0=90, x1=86, x2=86] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=24, x0=86, x1=85, x2=85] [L19] i++ VAL [i=25, x0=86, x1=85, x2=85] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=25, x0=85, x1=83, x2=83] [L19] i++ VAL [i=26, x0=85, x1=83, x2=83] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=26, x0=83, x1=81, x2=81] [L19] i++ VAL [i=27, x0=83, x1=81, x2=81] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=27, x0=81, x1=24, x2=24] [L19] i++ VAL [i=28, x0=81, x1=24, x2=24] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=28, x0=24, x1=19, x2=19] [L19] i++ VAL [i=29, x0=24, x1=19, x2=19] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=29, x0=19, x1=17, x2=17] [L19] i++ VAL [i=30, x0=19, x1=17, x2=17] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=30, x0=17, x1=15, x2=15] [L19] i++ VAL [i=31, x0=17, x1=15, x2=15] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=31, x0=15, x1=13, x2=13] [L19] i++ VAL [i=32, x0=15, x1=13, x2=13] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=32, x0=13, x1=11, x2=11] [L19] i++ VAL [i=33, x0=13, x1=11, x2=11] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=33, x0=11, x1=8, x2=8] [L19] i++ VAL [i=34, x0=11, x1=8, x2=8] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=34, x0=8, x1=7, x2=7] [L19] i++ VAL [i=35, x0=8, x1=7, x2=7] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=35, x0=7, x1=5, x2=5] [L19] i++ VAL [i=36, x0=7, x1=5, x2=5] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=36, x0=5, x1=3, x2=3] [L19] i++ VAL [i=37, x0=5, x1=3, x2=3] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=37, x0=3, x1=1, x2=1] [L19] i++ VAL [i=38, x0=3, x1=1, x2=1] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=38, x0=1, x1=47, x2=47] [L19] i++ VAL [i=39, x0=1, x1=47, x2=47] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=39, x0=47, x1=46, x2=46] [L19] i++ VAL [i=40, x0=47, x1=46, x2=46] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=40, x0=46, x1=44, x2=44] [L19] i++ VAL [i=41, x0=46, x1=44, x2=44] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=41, x0=44, x1=42, x2=42] [L19] i++ VAL [i=42, x0=44, x1=42, x2=42] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=42, x0=42, x1=40, x2=40] [L19] i++ VAL [i=43, x0=42, x1=40, x2=40] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=43, x0=40, x1=36, x2=36] [L19] i++ VAL [i=44, x0=40, x1=36, x2=36] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=44, x0=36, x1=35, x2=35] [L19] i++ VAL [i=45, x0=36, x1=35, x2=35] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=45, x0=35, x1=33, x2=33] [L19] i++ VAL [i=46, x0=35, x1=33, x2=33] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=46, x0=33, x1=31, x2=31] [L19] i++ VAL [i=47, x0=33, x1=31, x2=31] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=47, x0=31, x1=29, x2=29] [L19] i++ VAL [i=48, x0=31, x1=29, x2=29] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=48, x0=29, x1=50, x2=50] [L19] i++ VAL [i=49, x0=29, x1=50, x2=50] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=49, x0=50, x1=60, x2=60] [L19] i++ VAL [i=50, x0=50, x1=60, x2=60] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=50, x0=60, x1=59, x2=59] [L19] i++ VAL [i=51, x0=60, x1=59, x2=59] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=51, x0=59, x1=58, x2=58] [L19] i++ VAL [i=52, x0=59, x1=58, x2=58] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=52, x0=58, x1=57, x2=57] [L19] i++ VAL [i=53, x0=58, x1=57, x2=57] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=53, x0=57, x1=68, x2=68] [L19] i++ VAL [i=54, x0=57, x1=68, x2=68] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=54, x0=68, x1=66, x2=66] [L19] i++ VAL [i=55, x0=68, x1=66, x2=66] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=55, x0=66, x1=75, x2=75] [L19] i++ VAL [i=56, x0=66, x1=75, x2=75] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=56, x0=75, x1=74, x2=74] [L19] i++ VAL [i=57, x0=75, x1=74, x2=74] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=57, x0=74, x1=73, x2=73] [L19] i++ VAL [i=58, x0=74, x1=73, x2=73] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=58, x0=73, x1=84, x2=84] [L19] i++ VAL [i=59, x0=73, x1=84, x2=84] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=59, x0=84, x1=82, x2=82] [L19] i++ VAL [i=60, x0=84, x1=82, x2=82] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=60, x0=82, x1=89, x2=89] [L19] i++ VAL [i=61, x0=82, x1=89, x2=89] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=61, x0=89, x1=88, x2=88] [L19] i++ VAL [i=62, x0=89, x1=88, x2=88] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=62, x0=88, x1=87, x2=87] [L19] i++ VAL [i=63, x0=88, x1=87, x2=87] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=63, x0=87, x1=96, x2=96] [L19] i++ VAL [i=64, x0=87, x1=96, x2=96] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=64, x0=96, x1=94, x2=94] [L19] i++ VAL [i=65, x0=96, x1=94, x2=94] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=65, x0=94, x1=92, x2=92] [L19] i++ VAL [i=66, x0=94, x1=92, x2=92] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=66, x0=92, x1=99, x2=99] [L19] i++ VAL [i=67, x0=92, x1=99, x2=99] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=67, x0=99, x1=98, x2=98] [L19] i++ VAL [i=68, x0=99, x1=98, x2=98] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=68, x0=98, x1=6, x2=6] [L19] i++ VAL [i=69, x0=98, x1=6, x2=6] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=69, x0=6, x1=4, x2=4] [L19] i++ VAL [i=70, x0=6, x1=4, x2=4] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=70, x0=4, x1=2, x2=2] [L19] i++ VAL [i=71, x0=4, x1=2, x2=2] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=71, x0=2, x1=10, x2=10] [L19] i++ VAL [i=72, x0=2, x1=10, x2=10] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=72, x0=10, x1=9, x2=9] [L19] i++ VAL [i=73, x0=10, x1=9, x2=9] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=73, x0=9, x1=18, x2=18] [L19] i++ VAL [i=74, x0=9, x1=18, x2=18] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=74, x0=18, x1=16, x2=16] [L19] i++ VAL [i=75, x0=18, x1=16, x2=16] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=75, x0=16, x1=14, x2=14] [L19] i++ VAL [i=76, x0=16, x1=14, x2=14] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=76, x0=14, x1=12, x2=12] [L19] i++ VAL [i=77, x0=14, x1=12, x2=12] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=77, x0=12, x1=20, x2=20] [L19] i++ VAL [i=78, x0=12, x1=20, x2=20] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=78, x0=20, x1=34, x2=34] [L19] i++ VAL [i=79, x0=20, x1=34, x2=34] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=79, x0=34, x1=32, x2=32] [L19] i++ VAL [i=80, x0=34, x1=32, x2=32] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=80, x0=32, x1=30, x2=30] [L19] i++ VAL [i=81, x0=32, x1=30, x2=30] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=81, x0=30, x1=26, x2=26] [L19] i++ VAL [i=82, x0=30, x1=26, x2=26] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=82, x0=26, x1=37, x2=37] [L19] i++ VAL [i=83, x0=26, x1=37, x2=37] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=83, x0=37, x1=48, x2=48] [L19] i++ VAL [i=84, x0=37, x1=48, x2=48] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=84, x0=48, x1=45, x2=45] [L19] i++ VAL [i=85, x0=48, x1=45, x2=45] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=85, x0=45, x1=43, x2=43] [L19] i++ VAL [i=86, x0=45, x1=43, x2=43] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=86, x0=43, x1=41, x2=41] [L19] i++ VAL [i=87, x0=43, x1=41, x2=41] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=87, x0=41, x1=39, x2=39] [L19] i++ VAL [i=88, x0=41, x1=39, x2=39] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=88, x0=39, x1=62, x2=62] [L19] i++ VAL [i=89, x0=39, x1=62, x2=62] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=89, x0=62, x1=56, x2=56] [L19] i++ VAL [i=90, x0=62, x1=56, x2=56] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=90, x0=56, x1=55, x2=55] [L19] i++ VAL [i=91, x0=56, x1=55, x2=55] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=91, x0=55, x1=53, x2=53] [L19] i++ VAL [i=92, x0=55, x1=53, x2=53] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=92, x0=53, x1=51, x2=51] [L19] i++ VAL [i=93, x0=53, x1=51, x2=51] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=93, x0=51, x1=78, x2=78] [L19] i++ VAL [i=94, x0=51, x1=78, x2=78] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=94, x0=78, x1=76, x2=76] [L19] i++ VAL [i=95, x0=78, x1=76, x2=76] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=95, x0=76, x1=72, x2=72] [L19] i++ VAL [i=96, x0=76, x1=72, x2=72] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=96, x0=72, x1=71, x2=71] [L19] i++ VAL [i=97, x0=72, x1=71, x2=71] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=97, x0=71, x1=69, x2=69] [L19] i++ VAL [i=98, x0=71, x1=69, x2=69] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=98, x0=69, x1=27, x2=27] [L19] i++ VAL [i=99, x0=69, x1=27, x2=27] [L19] COND TRUE i < 100 [L20] x2 = 111. - (1130. - 3000. / x0) / x1 [L21] x0 = x1 [L22] x1 = x2 VAL [i=99, x0=27, x1=38, x2=38] [L19] i++ VAL [i=100, x0=27, x1=38, x2=38] [L19] COND FALSE !(i < 100) VAL [i=100, x0=27, x1=38, x2=38] [L25] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 167.5s OverallTime, 102 OverallIterations, 100 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1019 SDtfs, 5050 SDslu, 28936 SDs, 0 SdLazy, 13916 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16043 GetRequests, 10993 SyntacticMatches, 0 SemanticMatches, 5050 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 128.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 99 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.5s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 133.7s InterpolantComputationTime, 22010 NumberOfCodeBlocks, 22010 NumberOfCodeBlocksAsserted, 2717 NumberOfCheckSat, 21600 ConstructedInterpolants, 0 QuantifiedInterpolants, 8652582 SizeOfPredicates, 99 NumberOfNonLiveVariables, 36828 ConjunctsInSsa, 5148 ConjunctsInUnsatCore, 200 InterpolantComputations, 2 PerfectInterpolantSequences, 0/656700 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...