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/array-examples/standard_init2_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:58:53,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:58:53,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:58:53,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:58:53,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:58:53,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:58:53,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:58:53,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:58:53,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:58:53,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:58:53,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:58:53,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:58:53,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:58:53,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:58:53,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:58:53,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:58:53,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:58:53,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:58:53,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:58:53,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:58:53,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:58:53,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:58:53,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:58:53,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:58:53,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:58:53,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:58:53,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:58:53,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:58:53,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:58:53,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:58:53,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:58:53,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:58:53,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:58:53,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:58:53,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:58:53,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:58:53,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:58:53,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:58:53,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:58:53,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:58:53,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:58:53,202 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-10-01 22:58:53,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:58:53,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:58:53,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:58:53,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:58:53,233 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:58:53,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:58:53,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:58:53,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:58:53,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:58:53,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:58:53,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:58:53,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:58:53,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:58:53,237 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:58:53,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:58:53,237 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:58:53,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:58:53,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:58:53,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:58:53,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:58:53,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:58:53,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:58:53,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:58:53,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:58:53,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:58:53,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:58:53,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:58:53,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:58:53,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:58:53,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:58:53,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:58:53,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:58:53,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:58:53,331 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:58:53,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init2_ground-1.i [2019-10-01 22:58:53,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b3071b1/28a06c68b7c04bf982c603b352c9d41e/FLAG6505896e4 [2019-10-01 22:58:53,864 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:58:53,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_ground-1.i [2019-10-01 22:58:53,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b3071b1/28a06c68b7c04bf982c603b352c9d41e/FLAG6505896e4 [2019-10-01 22:58:54,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b3071b1/28a06c68b7c04bf982c603b352c9d41e [2019-10-01 22:58:54,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:58:54,276 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:58:54,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:58:54,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:58:54,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:58:54,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5d6135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54, skipping insertion in model container [2019-10-01 22:58:54,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,290 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:58:54,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:58:54,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:58:54,461 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:58:54,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:58:54,588 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:58:54,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54 WrapperNode [2019-10-01 22:58:54,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:58:54,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:58:54,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:58:54,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:58:54,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (1/1) ... [2019-10-01 22:58:54,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:58:54,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:58:54,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:58:54,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:58:54,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (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-10-01 22:58:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:58:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:58:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:58:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:58:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:58:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:58:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:58:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:58:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:58:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:58:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:58:54,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:58:54,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:58:55,034 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:58:55,035 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:58:55,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:58:55 BoogieIcfgContainer [2019-10-01 22:58:55,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:58:55,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:58:55,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:58:55,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:58:55,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:58:54" (1/3) ... [2019-10-01 22:58:55,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6055414a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:58:55, skipping insertion in model container [2019-10-01 22:58:55,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:58:54" (2/3) ... [2019-10-01 22:58:55,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6055414a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:58:55, skipping insertion in model container [2019-10-01 22:58:55,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:58:55" (3/3) ... [2019-10-01 22:58:55,060 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init2_ground-1.i [2019-10-01 22:58:55,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:58:55,075 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:58:55,091 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:58:55,117 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:58:55,117 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:58:55,118 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:58:55,118 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:58:55,118 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:58:55,118 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:58:55,118 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:58:55,118 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:58:55,118 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:58:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-01 22:58:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:58:55,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:55,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:55,143 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2104113866, now seen corresponding path program 1 times [2019-10-01 22:58:55,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:55,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:55,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:55,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:58:55,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:58:55,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:58:55,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:58:55,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:58:55,320 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-10-01 22:58:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:55,347 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-10-01 22:58:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:58:55,348 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 22:58:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:55,359 INFO L225 Difference]: With dead ends: 43 [2019-10-01 22:58:55,359 INFO L226 Difference]: Without dead ends: 20 [2019-10-01 22:58:55,363 INFO L640 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-10-01 22:58:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-01 22:58:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-01 22:58:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-01 22:58:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-01 22:58:55,413 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2019-10-01 22:58:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:55,414 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-01 22:58:55,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:58:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-01 22:58:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 22:58:55,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:55,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:55,416 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash 743997126, now seen corresponding path program 1 times [2019-10-01 22:58:55,417 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:55,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:55,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:55,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:55,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:58:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:58:55,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:58:55,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:58:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:58:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:58:55,481 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-10-01 22:58:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:55,540 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-10-01 22:58:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:58:55,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 22:58:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:55,543 INFO L225 Difference]: With dead ends: 35 [2019-10-01 22:58:55,543 INFO L226 Difference]: Without dead ends: 22 [2019-10-01 22:58:55,545 INFO L640 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-10-01 22:58:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-01 22:58:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-01 22:58:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-01 22:58:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-01 22:58:55,558 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-01 22:58:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:55,559 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-01 22:58:55,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:58:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-01 22:58:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:58:55,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:55,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:55,562 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:55,563 INFO L82 PathProgramCache]: Analyzing trace with hash 494025381, now seen corresponding path program 1 times [2019-10-01 22:58:55,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:55,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:55,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:55,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:58:55,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:55,718 INFO L224 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-10-01 22:58:55,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:55,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:58:55,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:58:55,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:55,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:58:55,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:58:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:58:55,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:58:55,858 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-10-01 22:58:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:55,911 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-10-01 22:58:55,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:58:55,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-01 22:58:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:55,913 INFO L225 Difference]: With dead ends: 38 [2019-10-01 22:58:55,913 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 22:58:55,914 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-10-01 22:58:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 22:58:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-01 22:58:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 22:58:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-01 22:58:55,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-01 22:58:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:55,920 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-01 22:58:55,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:58:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-01 22:58:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 22:58:55,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:55,922 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:55,922 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash -254426330, now seen corresponding path program 2 times [2019-10-01 22:58:55,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:55,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:55,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:55,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:55,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 22:58:56,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:56,005 INFO L224 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-10-01 22:58:56,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:58:56,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:58:56,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:56,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:58:56,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 22:58:56,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:56,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:58:56,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:58:56,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:58:56,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:58:56,093 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2019-10-01 22:58:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:56,148 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-10-01 22:58:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:58:56,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-01 22:58:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:56,150 INFO L225 Difference]: With dead ends: 41 [2019-10-01 22:58:56,150 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:58:56,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:58:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:58:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:58:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:58:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-01 22:58:56,163 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2019-10-01 22:58:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:56,163 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-01 22:58:56,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:58:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-01 22:58:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 22:58:56,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:56,167 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:56,167 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash -254217403, now seen corresponding path program 3 times [2019-10-01 22:58:56,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:56,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:56,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:56,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:56,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:58:56,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:56,297 INFO L224 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-10-01 22:58:56,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:58:56,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:58:56,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:56,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:58:56,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:58:56,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:56,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:58:56,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:58:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:58:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:58:56,375 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2019-10-01 22:58:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:56,429 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-10-01 22:58:56,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:58:56,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-01 22:58:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:56,431 INFO L225 Difference]: With dead ends: 44 [2019-10-01 22:58:56,431 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:58:56,432 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:58:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:58:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-01 22:58:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:58:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-01 22:58:56,438 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2019-10-01 22:58:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:56,439 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-01 22:58:56,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:58:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-01 22:58:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 22:58:56,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:56,440 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:56,440 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1902727046, now seen corresponding path program 4 times [2019-10-01 22:58:56,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:56,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:56,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:56,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 22:58:56,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:56,544 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:56,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:58:56,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:58:56,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:56,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:58:56,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 22:58:56,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:56,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:58:56,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:58:56,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:58:56,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:58:56,636 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2019-10-01 22:58:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:56,686 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-10-01 22:58:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:58:56,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-10-01 22:58:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:56,687 INFO L225 Difference]: With dead ends: 47 [2019-10-01 22:58:56,688 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:58:56,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:58:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:58:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-01 22:58:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-01 22:58:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-01 22:58:56,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-10-01 22:58:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:56,694 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-01 22:58:56,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:58:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-01 22:58:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 22:58:56,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:56,695 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:56,696 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash 768730085, now seen corresponding path program 5 times [2019-10-01 22:58:56,696 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:56,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:58:56,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:56,774 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:58:56,799 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:56,858 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-01 22:58:56,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:56,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:58:56,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:58:56,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:56,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:58:56,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:58:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:58:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:58:56,887 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-10-01 22:58:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:56,958 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-10-01 22:58:56,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:58:56,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-01 22:58:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:56,962 INFO L225 Difference]: With dead ends: 50 [2019-10-01 22:58:56,962 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 22:58:56,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:58:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 22:58:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-01 22:58:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:58:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-01 22:58:56,975 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2019-10-01 22:58:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:56,976 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-01 22:58:56,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:58:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-01 22:58:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:58:56,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:56,977 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:56,978 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:56,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:56,978 INFO L82 PathProgramCache]: Analyzing trace with hash 598811622, now seen corresponding path program 6 times [2019-10-01 22:58:56,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:56,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:56,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:56,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:56,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 22:58:57,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:57,128 INFO L224 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-10-01 22:58:57,152 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:58:57,203 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-01 22:58:57,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:57,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:58:57,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 22:58:57,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:57,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:58:57,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:58:57,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:58:57,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:58:57,233 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2019-10-01 22:58:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:57,320 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2019-10-01 22:58:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:58:57,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-01 22:58:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:57,323 INFO L225 Difference]: With dead ends: 53 [2019-10-01 22:58:57,323 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:58:57,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:58:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:58:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-01 22:58:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 22:58:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-01 22:58:57,337 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2019-10-01 22:58:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:57,337 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-01 22:58:57,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:58:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-01 22:58:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:58:57,340 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:57,340 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:57,340 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1765864315, now seen corresponding path program 7 times [2019-10-01 22:58:57,341 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:57,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:57,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:57,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:57,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 22:58:57,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:57,494 INFO L224 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-10-01 22:58:57,526 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-10-01 22:58:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:57,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:58:57,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-01 22:58:57,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:57,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:58:57,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:58:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:58:57,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:58:57,573 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 11 states. [2019-10-01 22:58:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:57,662 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-10-01 22:58:57,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:58:57,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-10-01 22:58:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:57,664 INFO L225 Difference]: With dead ends: 56 [2019-10-01 22:58:57,664 INFO L226 Difference]: Without dead ends: 36 [2019-10-01 22:58:57,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:58:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-01 22:58:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-01 22:58:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 22:58:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-01 22:58:57,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2019-10-01 22:58:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:57,681 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-01 22:58:57,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:58:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-01 22:58:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 22:58:57,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:57,684 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:57,684 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:57,685 INFO L82 PathProgramCache]: Analyzing trace with hash 97206342, now seen corresponding path program 8 times [2019-10-01 22:58:57,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:57,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:57,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:58:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:58:57,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:57,847 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:57,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:58:57,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:58:57,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:57,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:58:57,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:58:57,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:57,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:58:57,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:58:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:58:57,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:58:57,940 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 12 states. [2019-10-01 22:58:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:58,003 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-10-01 22:58:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:58:58,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-10-01 22:58:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:58,007 INFO L225 Difference]: With dead ends: 59 [2019-10-01 22:58:58,007 INFO L226 Difference]: Without dead ends: 38 [2019-10-01 22:58:58,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:58:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-01 22:58:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-01 22:58:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-01 22:58:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-10-01 22:58:58,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2019-10-01 22:58:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:58,018 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-10-01 22:58:58,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:58:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-10-01 22:58:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 22:58:58,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:58,020 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:58,021 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1434610981, now seen corresponding path program 9 times [2019-10-01 22:58:58,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:58,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:58,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-01 22:58:58,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:58,163 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:58,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:58:58,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:58:58,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:58,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:58:58,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:58:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:58,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2019-10-01 22:58:58,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:58:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:58:58,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:58:58,327 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2019-10-01 22:58:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:58,374 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-10-01 22:58:58,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:58:58,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-10-01 22:58:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:58,376 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:58:58,376 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:58:58,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:58:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:58:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-01 22:58:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 22:58:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-10-01 22:58:58,382 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2019-10-01 22:58:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:58,382 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-10-01 22:58:58,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:58:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-10-01 22:58:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 22:58:58,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:58,383 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:58,384 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:58,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2119541926, now seen corresponding path program 10 times [2019-10-01 22:58:58,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:58,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:58,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:58,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:58,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 22:58:58,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:58,520 INFO L224 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-10-01 22:58:58,540 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-10-01 22:58:58,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:58:58,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:58,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:58:58,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-01 22:58:58,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:58,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:58:58,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:58:58,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:58:58,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:58:58,600 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 14 states. [2019-10-01 22:58:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:58,659 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-10-01 22:58:58,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:58:58,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-10-01 22:58:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:58,660 INFO L225 Difference]: With dead ends: 65 [2019-10-01 22:58:58,661 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 22:58:58,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:58:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 22:58:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-01 22:58:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 22:58:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-01 22:58:58,675 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 35 [2019-10-01 22:58:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:58,675 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-01 22:58:58,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:58:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-01 22:58:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 22:58:58,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:58,679 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:58,680 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash 461243845, now seen corresponding path program 11 times [2019-10-01 22:58:58,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:58,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:58,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:58,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:58,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 22:58:58,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:58,834 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:58,861 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:58:59,256 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 22:58:59,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:58:59,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:58:59,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:58:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 22:58:59,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:58:59,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:58:59,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:58:59,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:58:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:58:59,295 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 15 states. [2019-10-01 22:58:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:59,369 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-10-01 22:58:59,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:58:59,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-10-01 22:58:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:59,371 INFO L225 Difference]: With dead ends: 68 [2019-10-01 22:58:59,371 INFO L226 Difference]: Without dead ends: 44 [2019-10-01 22:58:59,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:58:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-01 22:58:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-01 22:58:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:58:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-01 22:58:59,386 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2019-10-01 22:58:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:59,386 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-01 22:58:59,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:58:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-01 22:58:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 22:58:59,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:59,388 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:59,388 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1013862662, now seen corresponding path program 12 times [2019-10-01 22:58:59,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:59,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:59,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-01 22:58:59,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:59,550 INFO L224 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-10-01 22:58:59,567 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:59:00,061 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:59:00,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:00,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:59:00,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-01 22:59:00,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:00,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 22:59:00,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:59:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:59:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:59:00,103 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 16 states. [2019-10-01 22:59:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:00,159 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-10-01 22:59:00,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:59:00,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-10-01 22:59:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:00,161 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:59:00,161 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 22:59:00,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:59:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 22:59:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-01 22:59:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 22:59:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-10-01 22:59:00,169 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2019-10-01 22:59:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:00,169 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-01 22:59:00,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:59:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-10-01 22:59:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 22:59:00,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:00,171 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:00,171 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:00,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1100207717, now seen corresponding path program 13 times [2019-10-01 22:59:00,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:00,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:00,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:00,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:00,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-01 22:59:00,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:00,358 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:59:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:59:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:00,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:59:00,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-01 22:59:00,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:00,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:59:00,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:59:00,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:59:00,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:59:00,470 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 17 states. [2019-10-01 22:59:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:00,561 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-10-01 22:59:00,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:59:00,563 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-10-01 22:59:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:00,564 INFO L225 Difference]: With dead ends: 74 [2019-10-01 22:59:00,564 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 22:59:00,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:59:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 22:59:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-01 22:59:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-01 22:59:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-10-01 22:59:00,575 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2019-10-01 22:59:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:00,576 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-10-01 22:59:00,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:59:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-10-01 22:59:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 22:59:00,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:00,577 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:00,578 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash 397624678, now seen corresponding path program 14 times [2019-10-01 22:59:00,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:00,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:00,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:59:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 22:59:00,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:00,755 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:59:00,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:59:00,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:59:00,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:00,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:59:00,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-01 22:59:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:00,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:59:00,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:59:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:59:00,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:59:00,872 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 18 states. [2019-10-01 22:59:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:00,944 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-01 22:59:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:59:00,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2019-10-01 22:59:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:00,945 INFO L225 Difference]: With dead ends: 77 [2019-10-01 22:59:00,945 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 22:59:00,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:59:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 22:59:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-01 22:59:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 22:59:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-01 22:59:00,962 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2019-10-01 22:59:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:00,962 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-01 22:59:00,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:59:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-01 22:59:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 22:59:00,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:00,963 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:00,963 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:00,964 INFO L82 PathProgramCache]: Analyzing trace with hash -400171259, now seen corresponding path program 15 times [2019-10-01 22:59:00,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:00,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:00,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:00,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:00,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 22:59:01,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:01,137 INFO L224 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-10-01 22:59:01,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:59:01,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:59:01,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:01,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:59:01,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 22:59:01,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:01,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:59:01,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:59:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:59:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:59:01,626 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 19 states. [2019-10-01 22:59:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:01,698 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-10-01 22:59:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:59:01,699 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-10-01 22:59:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:01,700 INFO L225 Difference]: With dead ends: 80 [2019-10-01 22:59:01,700 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 22:59:01,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:59:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 22:59:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-01 22:59:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:59:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-01 22:59:01,706 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2019-10-01 22:59:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:01,706 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-01 22:59:01,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:59:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-01 22:59:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:59:01,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:01,707 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:01,708 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:01,708 INFO L82 PathProgramCache]: Analyzing trace with hash -264076858, now seen corresponding path program 16 times [2019-10-01 22:59:01,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:01,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:01,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:01,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-01 22:59:01,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:01,884 INFO L224 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-10-01 22:59:01,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:59:01,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:59:01,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:01,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:59:01,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:59:01,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:01,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:59:01,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:59:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:59:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:59:01,967 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 20 states. [2019-10-01 22:59:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:02,048 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-10-01 22:59:02,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:59:02,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-10-01 22:59:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:02,049 INFO L225 Difference]: With dead ends: 83 [2019-10-01 22:59:02,049 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 22:59:02,050 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:59:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 22:59:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-01 22:59:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-01 22:59:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-10-01 22:59:02,055 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2019-10-01 22:59:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:02,055 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-10-01 22:59:02,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:59:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-10-01 22:59:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-01 22:59:02,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:02,056 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:02,057 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash 387325861, now seen corresponding path program 17 times [2019-10-01 22:59:02,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:02,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:02,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:02,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:02,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-01 22:59:02,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:02,285 INFO L224 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-10-01 22:59:02,327 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:59:10,837 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-10-01 22:59:10,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:10,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:59:10,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-01 22:59:10,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:10,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:59:10,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:59:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:59:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:59:10,881 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 21 states. [2019-10-01 22:59:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:10,972 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-10-01 22:59:10,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:59:10,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-10-01 22:59:10,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:10,973 INFO L225 Difference]: With dead ends: 86 [2019-10-01 22:59:10,973 INFO L226 Difference]: Without dead ends: 56 [2019-10-01 22:59:10,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:59:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-01 22:59:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-01 22:59:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 22:59:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-10-01 22:59:10,984 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 49 [2019-10-01 22:59:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:10,984 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-10-01 22:59:10,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:59:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-10-01 22:59:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 22:59:10,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:10,985 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:10,986 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:10,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1900411354, now seen corresponding path program 18 times [2019-10-01 22:59:10,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:10,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:10,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-01 22:59:11,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:11,280 INFO L224 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-10-01 22:59:11,302 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:59:15,429 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 22:59:15,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:15,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:59:15,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-01 22:59:15,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:15,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:59:15,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:59:15,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:59:15,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:59:15,469 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 22 states. [2019-10-01 22:59:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:15,555 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-10-01 22:59:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:59:15,555 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-10-01 22:59:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:15,556 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:59:15,556 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 22:59:15,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:59:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 22:59:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-01 22:59:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 22:59:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-01 22:59:15,561 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 51 [2019-10-01 22:59:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:15,562 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-01 22:59:15,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:59:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-01 22:59:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 22:59:15,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:15,563 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:15,563 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash -574187451, now seen corresponding path program 19 times [2019-10-01 22:59:15,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:15,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:15,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-01 22:59:15,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:15,811 INFO L224 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-10-01 22:59:15,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:59:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:15,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:59:15,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:59:15,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:15,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:59:15,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:59:15,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:59:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:59:15,909 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 23 states. [2019-10-01 22:59:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:15,993 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-10-01 22:59:15,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:59:15,993 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-10-01 22:59:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:15,994 INFO L225 Difference]: With dead ends: 92 [2019-10-01 22:59:15,994 INFO L226 Difference]: Without dead ends: 60 [2019-10-01 22:59:15,995 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:59:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-01 22:59:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-01 22:59:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 22:59:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-01 22:59:16,000 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2019-10-01 22:59:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:16,012 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-01 22:59:16,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:59:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-01 22:59:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:59:16,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:16,013 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:16,014 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2076716410, now seen corresponding path program 20 times [2019-10-01 22:59:16,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:16,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:16,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:16,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:59:16,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 22:59:16,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:16,311 INFO L224 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-10-01 22:59:16,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:59:16,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:59:16,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:16,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:59:16,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-01 22:59:16,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:16,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:59:16,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:59:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:59:16,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:59:16,404 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 24 states. [2019-10-01 22:59:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:16,518 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-10-01 22:59:16,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:59:16,521 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2019-10-01 22:59:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:16,522 INFO L225 Difference]: With dead ends: 95 [2019-10-01 22:59:16,522 INFO L226 Difference]: Without dead ends: 62 [2019-10-01 22:59:16,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:59:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-01 22:59:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-01 22:59:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 22:59:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-01 22:59:16,527 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 55 [2019-10-01 22:59:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:16,527 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-01 22:59:16,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:59:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-01 22:59:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 22:59:16,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:16,528 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:16,528 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1931036901, now seen corresponding path program 21 times [2019-10-01 22:59:16,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:16,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:16,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:16,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:16,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-01 22:59:16,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:16,804 INFO L224 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-10-01 22:59:16,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:59:18,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:59:18,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:18,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:59:18,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-01 22:59:18,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:18,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:59:18,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:59:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:59:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:59:18,674 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 25 states. [2019-10-01 22:59:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:18,769 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2019-10-01 22:59:18,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:59:18,769 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2019-10-01 22:59:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:18,770 INFO L225 Difference]: With dead ends: 98 [2019-10-01 22:59:18,770 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:59:18,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:59:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:59:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-01 22:59:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-01 22:59:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-10-01 22:59:18,774 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2019-10-01 22:59:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:18,774 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-10-01 22:59:18,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:59:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-10-01 22:59:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 22:59:18,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:18,775 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:18,776 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash 173663974, now seen corresponding path program 22 times [2019-10-01 22:59:18,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:18,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:18,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 22:59:19,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:19,227 INFO L224 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-10-01 22:59:19,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:59:19,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:59:19,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:19,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:59:19,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-01 22:59:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:59:19,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:59:19,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:59:19,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:59:19,373 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 26 states. [2019-10-01 22:59:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:19,478 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-10-01 22:59:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:59:19,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2019-10-01 22:59:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:19,484 INFO L225 Difference]: With dead ends: 101 [2019-10-01 22:59:19,484 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 22:59:19,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:59:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 22:59:19,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-01 22:59:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-01 22:59:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-01 22:59:19,489 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2019-10-01 22:59:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:19,489 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-01 22:59:19,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:59:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-01 22:59:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-01 22:59:19,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:19,490 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:19,491 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:19,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1433416069, now seen corresponding path program 23 times [2019-10-01 22:59:19,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:19,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:19,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 22:59:19,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:19,850 INFO L224 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-10-01 22:59:19,876 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:59:53,687 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 22:59:53,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:53,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:59:53,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 22:59:53,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:53,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 22:59:53,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:59:53,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:59:53,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:59:53,748 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 27 states. [2019-10-01 22:59:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:53,829 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-10-01 22:59:53,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:59:53,829 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2019-10-01 22:59:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:53,830 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:59:53,830 INFO L226 Difference]: Without dead ends: 68 [2019-10-01 22:59:53,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:59:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-01 22:59:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-01 22:59:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 22:59:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-10-01 22:59:53,834 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 61 [2019-10-01 22:59:53,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:53,835 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-10-01 22:59:53,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:59:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-10-01 22:59:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 22:59:53,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:53,836 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:53,836 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash -482458810, now seen corresponding path program 24 times [2019-10-01 22:59:53,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:53,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:53,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-01 22:59:54,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:54,222 INFO L224 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-10-01 22:59:54,270 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:00:06,575 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:00:06,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:06,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:00:06,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:00:06,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:06,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:00:06,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:00:06,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:00:06,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:00:06,616 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 28 states. [2019-10-01 23:00:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:06,705 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2019-10-01 23:00:06,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:00:06,705 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2019-10-01 23:00:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:06,706 INFO L225 Difference]: With dead ends: 107 [2019-10-01 23:00:06,706 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 23:00:06,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:00:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 23:00:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-01 23:00:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 23:00:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-10-01 23:00:06,713 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-10-01 23:00:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:06,714 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-10-01 23:00:06,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:00:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-10-01 23:00:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 23:00:06,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:06,715 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:06,715 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:06,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1789743653, now seen corresponding path program 25 times [2019-10-01 23:00:06,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:06,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:06,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:06,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:06,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:00:07,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:07,155 INFO L224 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-10-01 23:00:07,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:00:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:07,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:00:07,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:00:07,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:07,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:00:07,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:00:07,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:00:07,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:00:07,273 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 29 states. [2019-10-01 23:00:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:07,378 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2019-10-01 23:00:07,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:00:07,378 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2019-10-01 23:00:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:07,379 INFO L225 Difference]: With dead ends: 110 [2019-10-01 23:00:07,379 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 23:00:07,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:00:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 23:00:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-01 23:00:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 23:00:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-10-01 23:00:07,384 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 65 [2019-10-01 23:00:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:07,385 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-10-01 23:00:07,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:00:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-10-01 23:00:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 23:00:07,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:07,386 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:07,386 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash 964880294, now seen corresponding path program 26 times [2019-10-01 23:00:07,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:07,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:07,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:07,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:00:07,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:00:07,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:07,935 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:07,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:00:08,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:00:08,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:08,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:00:08,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:00:08,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:08,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:00:08,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:00:08,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:00:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:00:08,088 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 30 states. [2019-10-01 23:00:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:08,234 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-10-01 23:00:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:00:08,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-10-01 23:00:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:08,236 INFO L225 Difference]: With dead ends: 113 [2019-10-01 23:00:08,237 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 23:00:08,238 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:00:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 23:00:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-01 23:00:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-01 23:00:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-10-01 23:00:08,244 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2019-10-01 23:00:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:08,244 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-10-01 23:00:08,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:00:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-10-01 23:00:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-01 23:00:08,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:08,246 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:08,246 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:08,247 INFO L82 PathProgramCache]: Analyzing trace with hash 540191429, now seen corresponding path program 27 times [2019-10-01 23:00:08,247 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:08,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:08,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-10-01 23:00:08,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:08,706 INFO L224 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-10-01 23:00:08,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:00:14,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:00:14,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:14,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:00:14,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 27 proven. 378 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:00:15,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:15,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 32 [2019-10-01 23:00:15,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:00:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:00:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:00:15,073 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 32 states. [2019-10-01 23:00:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:15,222 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2019-10-01 23:00:15,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:00:15,222 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-10-01 23:00:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:15,223 INFO L225 Difference]: With dead ends: 116 [2019-10-01 23:00:15,223 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 23:00:15,224 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:00:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 23:00:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-01 23:00:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-01 23:00:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-10-01 23:00:15,229 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2019-10-01 23:00:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:15,229 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-10-01 23:00:15,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:00:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-10-01 23:00:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 23:00:15,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:15,230 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:15,230 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:15,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2142907386, now seen corresponding path program 28 times [2019-10-01 23:00:15,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:15,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:15,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:15,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:15,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-10-01 23:00:15,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:15,628 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:15,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:00:15,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:00:15,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:15,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:00:15,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:00:15,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:15,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:00:15,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:00:15,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:00:15,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:00:15,730 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 32 states. [2019-10-01 23:00:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:15,873 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2019-10-01 23:00:15,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:00:15,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-10-01 23:00:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:15,875 INFO L225 Difference]: With dead ends: 119 [2019-10-01 23:00:15,876 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 23:00:15,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:00:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 23:00:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-01 23:00:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 23:00:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-01 23:00:15,881 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2019-10-01 23:00:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:15,881 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-01 23:00:15,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:00:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-01 23:00:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-01 23:00:15,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:15,882 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:15,882 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1964885147, now seen corresponding path program 29 times [2019-10-01 23:00:15,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:15,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:15,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:15,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:15,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-01 23:00:16,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:16,436 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:16,493 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:01:17,537 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-10-01 23:01:17,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:17,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:01:17,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-01 23:01:17,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:17,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:01:17,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:01:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:01:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:01:17,613 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 33 states. [2019-10-01 23:01:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:17,727 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2019-10-01 23:01:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:01:17,728 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2019-10-01 23:01:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:17,729 INFO L225 Difference]: With dead ends: 122 [2019-10-01 23:01:17,729 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:01:17,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:01:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:01:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-01 23:01:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-01 23:01:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-10-01 23:01:17,735 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 73 [2019-10-01 23:01:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:17,735 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-10-01 23:01:17,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:01:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-10-01 23:01:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 23:01:17,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:17,736 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:17,736 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:17,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1394935910, now seen corresponding path program 30 times [2019-10-01 23:01:17,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:17,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:17,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:01:18,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:18,189 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:18,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:02:14,800 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 23:02:14,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:02:14,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:02:14,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-01 23:02:14,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:14,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-01 23:02:14,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:02:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:02:14,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:02:14,873 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 34 states. [2019-10-01 23:02:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:14,983 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-10-01 23:02:14,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 23:02:14,984 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-10-01 23:02:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:14,985 INFO L225 Difference]: With dead ends: 125 [2019-10-01 23:02:14,985 INFO L226 Difference]: Without dead ends: 82 [2019-10-01 23:02:14,986 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:02:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-01 23:02:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-10-01 23:02:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 23:02:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-10-01 23:02:14,991 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 75 [2019-10-01 23:02:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:14,991 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-10-01 23:02:14,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:02:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-10-01 23:02:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 23:02:14,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:14,992 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:14,992 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2028076027, now seen corresponding path program 31 times [2019-10-01 23:02:14,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:14,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:14,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:14,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:02:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-01 23:02:15,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:15,473 INFO L224 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-10-01 23:02:15,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:02:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:15,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:02:15,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-01 23:02:15,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:15,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:02:15,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:02:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:02:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:02:15,584 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 35 states. [2019-10-01 23:02:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:15,714 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2019-10-01 23:02:15,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:02:15,714 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2019-10-01 23:02:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:15,715 INFO L225 Difference]: With dead ends: 128 [2019-10-01 23:02:15,715 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 23:02:15,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:02:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 23:02:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-10-01 23:02:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-01 23:02:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-10-01 23:02:15,721 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 77 [2019-10-01 23:02:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:15,721 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-10-01 23:02:15,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:02:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-10-01 23:02:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-01 23:02:15,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:15,722 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:15,723 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1446937798, now seen corresponding path program 32 times [2019-10-01 23:02:15,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:15,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:15,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:15,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:02:15,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-01 23:02:16,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:16,188 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:02:16,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:02:16,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:02:16,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:02:16,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:02:16,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-01 23:02:16,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:16,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:02:16,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:02:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:02:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:02:16,335 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 36 states. [2019-10-01 23:02:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:16,491 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-10-01 23:02:16,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:02:16,491 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2019-10-01 23:02:16,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:16,492 INFO L225 Difference]: With dead ends: 131 [2019-10-01 23:02:16,492 INFO L226 Difference]: Without dead ends: 86 [2019-10-01 23:02:16,493 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:02:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-01 23:02:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-10-01 23:02:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-01 23:02:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-10-01 23:02:16,497 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 79 [2019-10-01 23:02:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:16,498 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-10-01 23:02:16,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:02:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-10-01 23:02:16,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 23:02:16,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:16,499 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:16,499 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:16,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:16,499 INFO L82 PathProgramCache]: Analyzing trace with hash -657980251, now seen corresponding path program 33 times [2019-10-01 23:02:16,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:16,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:16,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:16,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:02:16,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-10-01 23:02:17,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:17,022 INFO L224 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-10-01 23:02:17,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:02:38,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-01 23:02:38,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:02:38,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:02:38,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-10-01 23:02:38,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:38,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 23:02:38,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 23:02:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 23:02:38,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:02:38,862 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 37 states. [2019-10-01 23:02:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:39,006 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2019-10-01 23:02:39,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:02:39,006 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2019-10-01 23:02:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:39,007 INFO L225 Difference]: With dead ends: 134 [2019-10-01 23:02:39,007 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 23:02:39,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 23:02:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 23:02:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-10-01 23:02:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 23:02:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-10-01 23:02:39,012 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 81 [2019-10-01 23:02:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:39,012 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-10-01 23:02:39,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 23:02:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-10-01 23:02:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 23:02:39,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:39,014 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:39,014 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 372263206, now seen corresponding path program 34 times [2019-10-01 23:02:39,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:39,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:39,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:02:39,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-01 23:02:39,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:39,720 INFO L224 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-10-01 23:02:39,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:02:39,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:02:39,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:02:39,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:02:39,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:02:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:02:39,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:02:39,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:02:39,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:02:39,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:02:39,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:02:39,902 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 38 states. [2019-10-01 23:02:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:02:40,072 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2019-10-01 23:02:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:02:40,073 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-10-01 23:02:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:02:40,074 INFO L225 Difference]: With dead ends: 137 [2019-10-01 23:02:40,074 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 23:02:40,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:02:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 23:02:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-10-01 23:02:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-01 23:02:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-10-01 23:02:40,080 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 83 [2019-10-01 23:02:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:02:40,080 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-10-01 23:02:40,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:02:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-10-01 23:02:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 23:02:40,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:02:40,081 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:02:40,081 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:02:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:02:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1262632261, now seen corresponding path program 35 times [2019-10-01 23:02:40,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:02:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:02:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:40,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:02:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:02:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:02:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-01 23:02:40,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:02:40,909 INFO L224 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-10-01 23:02:40,955 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:04:42,050 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-10-01 23:04:42,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:04:42,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:04:42,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:04:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-01 23:04:42,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:04:42,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 23:04:42,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:04:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:04:42,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:04:42,159 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 39 states. [2019-10-01 23:04:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:04:42,304 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2019-10-01 23:04:42,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:04:42,306 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2019-10-01 23:04:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:04:42,307 INFO L225 Difference]: With dead ends: 140 [2019-10-01 23:04:42,308 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 23:04:42,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:04:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 23:04:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-01 23:04:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-01 23:04:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-10-01 23:04:42,321 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 85 [2019-10-01 23:04:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:04:42,321 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-10-01 23:04:42,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:04:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-10-01 23:04:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-01 23:04:42,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:04:42,323 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:04:42,328 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:04:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:04:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash -401058426, now seen corresponding path program 36 times [2019-10-01 23:04:42,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:04:42,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:04:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:04:42,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:04:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:04:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:04:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:04:43,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:04:43,212 INFO L224 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-10-01 23:04:43,261 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:06:31,724 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:06:31,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:06:31,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 23:06:31,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 36 proven. 666 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-10-01 23:06:31,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:31,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 41 [2019-10-01 23:06:31,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:06:31,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:06:31,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:06:31,845 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 41 states. [2019-10-01 23:06:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:32,023 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2019-10-01 23:06:32,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:06:32,023 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2019-10-01 23:06:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:32,024 INFO L225 Difference]: With dead ends: 143 [2019-10-01 23:06:32,025 INFO L226 Difference]: Without dead ends: 94 [2019-10-01 23:06:32,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:06:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-01 23:06:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-10-01 23:06:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-01 23:06:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-01 23:06:32,031 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 87 [2019-10-01 23:06:32,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:32,031 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-01 23:06:32,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:06:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-01 23:06:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-01 23:06:32,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:32,032 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:32,033 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash -781275675, now seen corresponding path program 37 times [2019-10-01 23:06:32,033 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:32,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:32,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:06:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 23:06:32,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:32,991 INFO L224 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-10-01 23:06:33,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:06:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:33,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:06:33,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 23:06:33,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:33,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:06:33,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:06:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:06:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:06:33,185 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 41 states. [2019-10-01 23:06:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:33,395 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2019-10-01 23:06:33,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:06:33,395 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 89 [2019-10-01 23:06:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:33,397 INFO L225 Difference]: With dead ends: 146 [2019-10-01 23:06:33,397 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 23:06:33,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:06:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 23:06:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-10-01 23:06:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-01 23:06:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-10-01 23:06:33,405 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 89 [2019-10-01 23:06:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:33,405 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-10-01 23:06:33,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:06:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-10-01 23:06:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 23:06:33,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:33,407 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:33,407 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:33,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash -913004058, now seen corresponding path program 38 times [2019-10-01 23:06:33,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:33,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:33,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:33,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:06:33,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-01 23:06:34,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:34,345 INFO L224 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-10-01 23:06:34,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:06:34,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:06:34,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:06:34,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:06:34,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:06:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-01 23:06:34,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:06:34,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 23:06:34,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:06:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:06:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:06:34,492 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 42 states. [2019-10-01 23:06:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:06:34,629 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2019-10-01 23:06:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:06:34,630 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 91 [2019-10-01 23:06:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:06:34,631 INFO L225 Difference]: With dead ends: 149 [2019-10-01 23:06:34,631 INFO L226 Difference]: Without dead ends: 98 [2019-10-01 23:06:34,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:06:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-01 23:06:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-10-01 23:06:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 23:06:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-10-01 23:06:34,637 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 91 [2019-10-01 23:06:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:06:34,637 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-10-01 23:06:34,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:06:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-10-01 23:06:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 23:06:34,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:06:34,638 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:06:34,638 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:06:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:06:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1515235707, now seen corresponding path program 39 times [2019-10-01 23:06:34,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:06:34,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:06:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:34,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:06:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:06:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:06:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-10-01 23:06:35,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:06:35,333 INFO L224 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-10-01 23:06:35,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:07:33,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-10-01 23:07:33,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:33,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:07:33,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 39 proven. 780 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-01 23:07:33,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:33,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43] total 44 [2019-10-01 23:07:33,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:07:33,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:07:33,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:07:33,095 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-10-01 23:07:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:33,223 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2019-10-01 23:07:33,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:07:33,224 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-10-01 23:07:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:33,225 INFO L225 Difference]: With dead ends: 152 [2019-10-01 23:07:33,225 INFO L226 Difference]: Without dead ends: 100 [2019-10-01 23:07:33,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:07:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-01 23:07:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-01 23:07:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-01 23:07:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-10-01 23:07:33,231 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2019-10-01 23:07:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:33,231 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-10-01 23:07:33,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:07:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-10-01 23:07:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 23:07:33,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:33,232 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:33,232 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:33,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1086539334, now seen corresponding path program 40 times [2019-10-01 23:07:33,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:33,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-10-01 23:07:33,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:33,939 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:07:33,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:07:34,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:07:34,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:34,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:07:34,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-10-01 23:07:34,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:34,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 23:07:34,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:07:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:07:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:07:34,103 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 44 states. [2019-10-01 23:07:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:34,283 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2019-10-01 23:07:34,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:07:34,285 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 95 [2019-10-01 23:07:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:34,286 INFO L225 Difference]: With dead ends: 155 [2019-10-01 23:07:34,287 INFO L226 Difference]: Without dead ends: 102 [2019-10-01 23:07:34,288 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:07:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-01 23:07:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-01 23:07:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 23:07:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-10-01 23:07:34,293 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 95 [2019-10-01 23:07:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:34,293 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-10-01 23:07:34,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:07:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-10-01 23:07:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 23:07:34,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:34,294 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:34,294 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1776695077, now seen corresponding path program 41 times [2019-10-01 23:07:34,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:34,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:34,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-10-01 23:07:35,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:35,116 INFO L224 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-10-01 23:07:35,169 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:10:02,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-10-01 23:10:02,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:10:02,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:10:02,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:10:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-10-01 23:10:02,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:10:02,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 23:10:02,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 23:10:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 23:10:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:10:02,653 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 45 states. [2019-10-01 23:10:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:10:02,785 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2019-10-01 23:10:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 23:10:02,787 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 97 [2019-10-01 23:10:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:10:02,788 INFO L225 Difference]: With dead ends: 158 [2019-10-01 23:10:02,788 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 23:10:02,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:10:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 23:10:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-01 23:10:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 23:10:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-10-01 23:10:02,795 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 97 [2019-10-01 23:10:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:10:02,796 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-10-01 23:10:02,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 23:10:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-10-01 23:10:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 23:10:02,797 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:10:02,797 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:10:02,797 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:10:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:10:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1010969254, now seen corresponding path program 42 times [2019-10-01 23:10:02,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:10:02,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:10:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:02,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:10:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:10:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:10:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-01 23:10:03,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:10:03,721 INFO L224 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-10-01 23:10:03,777 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:12:09,687 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-10-01 23:12:09,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:09,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:12:09,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-01 23:12:09,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-10-01 23:12:09,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 23:12:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 23:12:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:12:09,799 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 46 states. [2019-10-01 23:12:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:09,958 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2019-10-01 23:12:09,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 23:12:09,960 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 99 [2019-10-01 23:12:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:09,968 INFO L225 Difference]: With dead ends: 161 [2019-10-01 23:12:09,969 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 23:12:09,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 23:12:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 23:12:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-01 23:12:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:12:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-10-01 23:12:09,977 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 99 [2019-10-01 23:12:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:09,977 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-10-01 23:12:09,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 23:12:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-10-01 23:12:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-01 23:12:09,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:09,978 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:09,978 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:09,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1198870469, now seen corresponding path program 43 times [2019-10-01 23:12:09,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:09,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:09,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:09,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:09,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-10-01 23:12:10,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:10,784 INFO L224 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-10-01 23:12:10,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:10,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 23:12:10,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-10-01 23:12:10,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:10,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 23:12:10,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 23:12:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 23:12:10,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:12:10,964 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 47 states. [2019-10-01 23:12:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:11,142 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2019-10-01 23:12:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 23:12:11,143 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 101 [2019-10-01 23:12:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:11,144 INFO L225 Difference]: With dead ends: 164 [2019-10-01 23:12:11,144 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 23:12:11,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:12:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 23:12:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-10-01 23:12:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-01 23:12:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-10-01 23:12:11,150 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 101 [2019-10-01 23:12:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:11,151 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-10-01 23:12:11,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 23:12:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-10-01 23:12:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 23:12:11,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:11,152 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:11,152 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash -215001338, now seen corresponding path program 44 times [2019-10-01 23:12:11,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:11,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:11,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-10-01 23:12:12,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:12,110 INFO L224 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-10-01 23:12:12,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:12:12,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:12:12,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:12,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 23:12:12,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (45)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:12:12,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:12,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 23:12:12,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 23:12:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 23:12:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:12:12,276 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 48 states. [2019-10-01 23:12:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:12,502 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2019-10-01 23:12:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 23:12:12,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 103 [2019-10-01 23:12:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:12,503 INFO L225 Difference]: With dead ends: 167 [2019-10-01 23:12:12,503 INFO L226 Difference]: Without dead ends: 110 [2019-10-01 23:12:12,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:12:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-01 23:12:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-10-01 23:12:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 23:12:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-10-01 23:12:12,510 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 103 [2019-10-01 23:12:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:12,511 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-10-01 23:12:12,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 23:12:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-10-01 23:12:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-01 23:12:12,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:12,512 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:12,512 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 255762533, now seen corresponding path program 45 times [2019-10-01 23:12:12,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:12,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-10-01 23:12:13,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:13,390 INFO L224 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-10-01 23:12:13,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2