java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:58:11,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:58:11,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:58:11,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:58:11,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:58:11,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:58:11,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:58:11,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:58:11,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:58:11,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:58:11,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:58:11,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:58:11,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:58:11,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:58:11,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:58:11,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:58:11,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:58:11,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:58:11,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:58:11,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:58:11,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:58:11,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:58:11,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:58:11,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:58:11,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:58:11,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:58:11,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:58:11,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:58:11,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:58:11,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:58:11,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:58:11,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:58:11,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:58:11,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:58:11,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:58:11,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:58:11,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:58:11,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:58:11,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:58:11,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:58:11,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:58:11,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 12:58:11,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:58:11,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:58:11,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:58:11,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:58:11,339 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:58:11,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:58:11,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:58:11,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:58:11,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:58:11,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:58:11,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:58:11,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:58:11,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:58:11,340 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:58:11,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:58:11,341 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:58:11,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:58:11,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:58:11,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:58:11,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:58:11,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:58:11,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:11,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:58:11,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:58:11,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:58:11,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:58:11,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:58:11,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:58:11,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:58:11,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:58:11,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:58:11,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:58:11,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:58:11,393 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:58:11,393 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-20 12:58:11,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd128c06/d900a7156e4146f5aaf3b138a3a0b3ca/FLAG5f28b4444 [2019-09-20 12:58:11,901 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:58:11,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-20 12:58:11,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd128c06/d900a7156e4146f5aaf3b138a3a0b3ca/FLAG5f28b4444 [2019-09-20 12:58:12,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fd128c06/d900a7156e4146f5aaf3b138a3a0b3ca [2019-09-20 12:58:12,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:58:12,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:58:12,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:12,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:58:12,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:58:12,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183cea83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12, skipping insertion in model container [2019-09-20 12:58:12,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,329 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:58:12,348 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:58:12,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:12,506 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:58:12,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:12,547 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:58:12,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12 WrapperNode [2019-09-20 12:58:12,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:12,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:58:12,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:58:12,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:58:12,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (1/1) ... [2019-09-20 12:58:12,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:58:12,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:58:12,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:58:12,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:58:12,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:58:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:58:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:58:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:58:12,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:58:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:58:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:58:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:58:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:58:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:58:12,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:58:13,032 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:58:13,032 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 12:58:13,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:13 BoogieIcfgContainer [2019-09-20 12:58:13,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:58:13,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:58:13,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:58:13,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:58:13,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:58:12" (1/3) ... [2019-09-20 12:58:13,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c76509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:13, skipping insertion in model container [2019-09-20 12:58:13,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:12" (2/3) ... [2019-09-20 12:58:13,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c76509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:13, skipping insertion in model container [2019-09-20 12:58:13,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:13" (3/3) ... [2019-09-20 12:58:13,053 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-09-20 12:58:13,067 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:58:13,073 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:58:13,088 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:58:13,116 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:58:13,116 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:58:13,116 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:58:13,117 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:58:13,117 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:58:13,117 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:58:13,117 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:58:13,117 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:58:13,117 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:58:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-09-20 12:58:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 12:58:13,140 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:13,141 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:13,144 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:13,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-09-20 12:58:13,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:13,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:13,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:13,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:13,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:13,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:13,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:13,405 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-09-20 12:58:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:13,537 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2019-09-20 12:58:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:13,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-20 12:58:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:13,550 INFO L225 Difference]: With dead ends: 83 [2019-09-20 12:58:13,551 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 12:58:13,555 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 12:58:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-20 12:58:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 12:58:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-09-20 12:58:13,606 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-09-20 12:58:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:13,607 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-09-20 12:58:13,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-09-20 12:58:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 12:58:13,609 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:13,609 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:13,610 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-09-20 12:58:13,610 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:13,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:13,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:13,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:13,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:13,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:13,670 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-09-20 12:58:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:13,779 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2019-09-20 12:58:13,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:13,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-20 12:58:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:13,781 INFO L225 Difference]: With dead ends: 49 [2019-09-20 12:58:13,781 INFO L226 Difference]: Without dead ends: 47 [2019-09-20 12:58:13,783 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-20 12:58:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-20 12:58:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 12:58:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-09-20 12:58:13,795 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-09-20 12:58:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:13,796 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-09-20 12:58:13,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-09-20 12:58:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 12:58:13,797 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:13,797 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:13,797 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-09-20 12:58:13,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:13,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:13,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:13,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:13,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:13,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:13,896 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-09-20 12:58:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:14,131 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2019-09-20 12:58:14,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:14,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-20 12:58:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:14,134 INFO L225 Difference]: With dead ends: 79 [2019-09-20 12:58:14,134 INFO L226 Difference]: Without dead ends: 77 [2019-09-20 12:58:14,135 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-20 12:58:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-09-20 12:58:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-20 12:58:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-09-20 12:58:14,159 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-09-20 12:58:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:14,160 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-09-20 12:58:14,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-09-20 12:58:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 12:58:14,164 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:14,164 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:14,164 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-09-20 12:58:14,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:14,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:14,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:14,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:14,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:14,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:14,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:14,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:14,295 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-09-20 12:58:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:14,581 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2019-09-20 12:58:14,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:14,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-20 12:58:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:14,589 INFO L225 Difference]: With dead ends: 105 [2019-09-20 12:58:14,589 INFO L226 Difference]: Without dead ends: 103 [2019-09-20 12:58:14,590 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:58:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-20 12:58:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-09-20 12:58:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-20 12:58:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-09-20 12:58:14,636 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-09-20 12:58:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:14,636 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-09-20 12:58:14,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-09-20 12:58:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 12:58:14,638 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:14,639 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:14,639 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:14,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:14,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-09-20 12:58:14,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:14,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:14,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:14,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:14,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:14,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:14,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:14,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:14,719 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-09-20 12:58:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:14,795 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2019-09-20 12:58:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:14,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-20 12:58:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:14,799 INFO L225 Difference]: With dead ends: 106 [2019-09-20 12:58:14,799 INFO L226 Difference]: Without dead ends: 104 [2019-09-20 12:58:14,800 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-20 12:58:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-20 12:58:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-20 12:58:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-20 12:58:14,824 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-09-20 12:58:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:14,824 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-20 12:58:14,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-20 12:58:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 12:58:14,826 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:14,826 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:14,826 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-09-20 12:58:14,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:14,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:14,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:14,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:14,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:14,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:14,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:14,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:14,911 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-09-20 12:58:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:15,078 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-09-20 12:58:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:15,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-20 12:58:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:15,081 INFO L225 Difference]: With dead ends: 157 [2019-09-20 12:58:15,081 INFO L226 Difference]: Without dead ends: 155 [2019-09-20 12:58:15,082 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-20 12:58:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-09-20 12:58:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-20 12:58:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-09-20 12:58:15,107 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-09-20 12:58:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:15,107 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-09-20 12:58:15,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-09-20 12:58:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 12:58:15,109 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:15,109 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:15,109 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-09-20 12:58:15,110 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:15,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:15,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:15,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:15,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:15,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:15,173 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-09-20 12:58:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:15,393 INFO L93 Difference]: Finished difference Result 189 states and 291 transitions. [2019-09-20 12:58:15,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:15,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-20 12:58:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:15,396 INFO L225 Difference]: With dead ends: 189 [2019-09-20 12:58:15,397 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 12:58:15,398 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 12:58:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-09-20 12:58:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-20 12:58:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-09-20 12:58:15,436 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-09-20 12:58:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:15,437 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-09-20 12:58:15,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-09-20 12:58:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 12:58:15,443 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:15,443 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:15,444 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-09-20 12:58:15,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:15,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:15,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:15,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:15,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:58:15,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:58:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:58:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:58:15,490 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-09-20 12:58:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:15,529 INFO L93 Difference]: Finished difference Result 309 states and 481 transitions. [2019-09-20 12:58:15,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:58:15,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 12:58:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:15,535 INFO L225 Difference]: With dead ends: 309 [2019-09-20 12:58:15,535 INFO L226 Difference]: Without dead ends: 232 [2019-09-20 12:58:15,541 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:58:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-20 12:58:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-09-20 12:58:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 12:58:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-09-20 12:58:15,585 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-09-20 12:58:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:15,587 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-09-20 12:58:15,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:58:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-09-20 12:58:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 12:58:15,590 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:15,590 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:15,590 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:15,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:15,591 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-09-20 12:58:15,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:15,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:15,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:15,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:58:15,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:15,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:15,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:15,671 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-09-20 12:58:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:15,823 INFO L93 Difference]: Finished difference Result 276 states and 448 transitions. [2019-09-20 12:58:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:15,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-09-20 12:58:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:15,827 INFO L225 Difference]: With dead ends: 276 [2019-09-20 12:58:15,827 INFO L226 Difference]: Without dead ends: 274 [2019-09-20 12:58:15,828 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-20 12:58:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 244. [2019-09-20 12:58:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-20 12:58:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 393 transitions. [2019-09-20 12:58:15,859 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 393 transitions. Word has length 26 [2019-09-20 12:58:15,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:15,860 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 393 transitions. [2019-09-20 12:58:15,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 393 transitions. [2019-09-20 12:58:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:58:15,861 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:15,861 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:15,862 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-09-20 12:58:15,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:15,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:15,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:15,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:15,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:58:15,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:15,963 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-09-20 12:58:15,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:16,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:58:16,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:16,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:58:16,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:16,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2019-09-20 12:58:16,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 12:58:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 12:58:16,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:58:16,135 INFO L87 Difference]: Start difference. First operand 244 states and 393 transitions. Second operand 14 states. [2019-09-20 12:58:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:17,577 INFO L93 Difference]: Finished difference Result 692 states and 1129 transitions. [2019-09-20 12:58:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-20 12:58:17,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-09-20 12:58:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:17,583 INFO L225 Difference]: With dead ends: 692 [2019-09-20 12:58:17,583 INFO L226 Difference]: Without dead ends: 512 [2019-09-20 12:58:17,588 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-09-20 12:58:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-20 12:58:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 249. [2019-09-20 12:58:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-20 12:58:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 396 transitions. [2019-09-20 12:58:17,650 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 396 transitions. Word has length 28 [2019-09-20 12:58:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:17,650 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 396 transitions. [2019-09-20 12:58:17,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 12:58:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 396 transitions. [2019-09-20 12:58:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:58:17,652 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:17,652 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:17,652 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:17,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:17,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-09-20 12:58:17,653 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:17,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:17,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:17,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:17,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:58:17,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:17,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:17,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:17,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:17,743 INFO L87 Difference]: Start difference. First operand 249 states and 396 transitions. Second operand 7 states. [2019-09-20 12:58:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:18,004 INFO L93 Difference]: Finished difference Result 417 states and 693 transitions. [2019-09-20 12:58:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:18,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-20 12:58:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:18,010 INFO L225 Difference]: With dead ends: 417 [2019-09-20 12:58:18,010 INFO L226 Difference]: Without dead ends: 415 [2019-09-20 12:58:18,011 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:58:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-20 12:58:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 371. [2019-09-20 12:58:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-20 12:58:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 615 transitions. [2019-09-20 12:58:18,062 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 615 transitions. Word has length 31 [2019-09-20 12:58:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:18,062 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 615 transitions. [2019-09-20 12:58:18,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 615 transitions. [2019-09-20 12:58:18,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:58:18,064 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:18,065 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:18,065 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:18,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:18,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1955682911, now seen corresponding path program 1 times [2019-09-20 12:58:18,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:18,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:18,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:18,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:58:18,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:18,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:18,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:18,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:18,142 INFO L87 Difference]: Start difference. First operand 371 states and 615 transitions. Second operand 7 states. [2019-09-20 12:58:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:18,424 INFO L93 Difference]: Finished difference Result 392 states and 646 transitions. [2019-09-20 12:58:18,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:18,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-20 12:58:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:18,429 INFO L225 Difference]: With dead ends: 392 [2019-09-20 12:58:18,429 INFO L226 Difference]: Without dead ends: 390 [2019-09-20 12:58:18,430 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-20 12:58:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2019-09-20 12:58:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-09-20 12:58:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 624 transitions. [2019-09-20 12:58:18,484 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 624 transitions. Word has length 31 [2019-09-20 12:58:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:18,485 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 624 transitions. [2019-09-20 12:58:18,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 624 transitions. [2019-09-20 12:58:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 12:58:18,487 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:18,487 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:18,487 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-09-20 12:58:18,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:18,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:18,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 12:58:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:18,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:18,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:18,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:18,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:18,546 INFO L87 Difference]: Start difference. First operand 378 states and 624 transitions. Second operand 7 states. [2019-09-20 12:58:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:18,841 INFO L93 Difference]: Finished difference Result 431 states and 696 transitions. [2019-09-20 12:58:18,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:18,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-20 12:58:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:18,846 INFO L225 Difference]: With dead ends: 431 [2019-09-20 12:58:18,846 INFO L226 Difference]: Without dead ends: 429 [2019-09-20 12:58:18,847 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-09-20 12:58:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 308. [2019-09-20 12:58:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-20 12:58:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 494 transitions. [2019-09-20 12:58:18,892 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 494 transitions. Word has length 41 [2019-09-20 12:58:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:18,892 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 494 transitions. [2019-09-20 12:58:18,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 494 transitions. [2019-09-20 12:58:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 12:58:18,894 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:18,894 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:18,895 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1768387788, now seen corresponding path program 1 times [2019-09-20 12:58:18,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:18,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:18,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-20 12:58:18,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:18,984 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) [2019-09-20 12:58:19,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:19,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:58:19,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:58:19,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:19,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2019-09-20 12:58:19,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 12:58:19,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 12:58:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:58:19,104 INFO L87 Difference]: Start difference. First operand 308 states and 494 transitions. Second operand 12 states. [2019-09-20 12:58:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:20,149 INFO L93 Difference]: Finished difference Result 625 states and 1006 transitions. [2019-09-20 12:58:20,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:58:20,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-09-20 12:58:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:20,154 INFO L225 Difference]: With dead ends: 625 [2019-09-20 12:58:20,154 INFO L226 Difference]: Without dead ends: 483 [2019-09-20 12:58:20,155 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-09-20 12:58:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-20 12:58:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 308. [2019-09-20 12:58:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-20 12:58:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 493 transitions. [2019-09-20 12:58:20,205 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 493 transitions. Word has length 53 [2019-09-20 12:58:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:20,205 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 493 transitions. [2019-09-20 12:58:20,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 12:58:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 493 transitions. [2019-09-20 12:58:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 12:58:20,207 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:20,207 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:20,208 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-09-20 12:58:20,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:20,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:20,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:20,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-20 12:58:20,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:20,317 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) [2019-09-20 12:58:20,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:20,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 12:58:20,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-20 12:58:20,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:20,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-09-20 12:58:20,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 12:58:20,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 12:58:20,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:58:20,498 INFO L87 Difference]: Start difference. First operand 308 states and 493 transitions. Second operand 12 states. [2019-09-20 12:58:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:21,070 INFO L93 Difference]: Finished difference Result 671 states and 1079 transitions. [2019-09-20 12:58:21,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 12:58:21,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-20 12:58:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:21,074 INFO L225 Difference]: With dead ends: 671 [2019-09-20 12:58:21,074 INFO L226 Difference]: Without dead ends: 391 [2019-09-20 12:58:21,077 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-09-20 12:58:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-20 12:58:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 356. [2019-09-20 12:58:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-20 12:58:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 577 transitions. [2019-09-20 12:58:21,135 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 577 transitions. Word has length 61 [2019-09-20 12:58:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:21,136 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 577 transitions. [2019-09-20 12:58:21,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 12:58:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 577 transitions. [2019-09-20 12:58:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 12:58:21,139 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:21,139 INFO L407 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:21,140 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2141038378, now seen corresponding path program 1 times [2019-09-20 12:58:21,140 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:21,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-20 12:58:21,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:21,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:21,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:21,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:21,207 INFO L87 Difference]: Start difference. First operand 356 states and 577 transitions. Second operand 7 states. [2019-09-20 12:58:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:21,435 INFO L93 Difference]: Finished difference Result 417 states and 673 transitions. [2019-09-20 12:58:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:58:21,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-20 12:58:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:21,442 INFO L225 Difference]: With dead ends: 417 [2019-09-20 12:58:21,442 INFO L226 Difference]: Without dead ends: 415 [2019-09-20 12:58:21,443 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-20 12:58:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 360. [2019-09-20 12:58:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 12:58:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 580 transitions. [2019-09-20 12:58:21,506 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 580 transitions. Word has length 75 [2019-09-20 12:58:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:21,510 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 580 transitions. [2019-09-20 12:58:21,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 580 transitions. [2019-09-20 12:58:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 12:58:21,512 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:21,512 INFO L407 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:21,513 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:21,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1931813206, now seen corresponding path program 1 times [2019-09-20 12:58:21,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:21,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:21,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:21,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-20 12:58:21,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:21,614 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-09-20 12:58:21,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:21,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 12:58:21,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:21,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-20 12:58:21,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:21,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-20 12:58:21,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 12:58:21,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 12:58:21,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:58:21,855 INFO L87 Difference]: Start difference. First operand 360 states and 580 transitions. Second operand 14 states. [2019-09-20 12:58:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:23,074 INFO L93 Difference]: Finished difference Result 590 states and 952 transitions. [2019-09-20 12:58:23,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 12:58:23,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-09-20 12:58:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:23,080 INFO L225 Difference]: With dead ends: 590 [2019-09-20 12:58:23,080 INFO L226 Difference]: Without dead ends: 588 [2019-09-20 12:58:23,081 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=750, Unknown=0, NotChecked=0, Total=992 [2019-09-20 12:58:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-09-20 12:58:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 364. [2019-09-20 12:58:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 12:58:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 583 transitions. [2019-09-20 12:58:23,142 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 583 transitions. Word has length 83 [2019-09-20 12:58:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:23,142 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 583 transitions. [2019-09-20 12:58:23,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 12:58:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 583 transitions. [2019-09-20 12:58:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 12:58:23,144 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:23,145 INFO L407 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:23,145 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:23,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2023812105, now seen corresponding path program 2 times [2019-09-20 12:58:23,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:23,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:23,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:23,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-20 12:58:23,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:23,242 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:23,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:23,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:23,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:23,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-20 12:58:23,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-20 12:58:23,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:23,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-20 12:58:23,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-20 12:58:23,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-20 12:58:23,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:58:23,568 INFO L87 Difference]: Start difference. First operand 364 states and 583 transitions. Second operand 17 states. [2019-09-20 12:58:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:25,637 INFO L93 Difference]: Finished difference Result 725 states and 1184 transitions. [2019-09-20 12:58:25,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-20 12:58:25,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-09-20 12:58:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:25,644 INFO L225 Difference]: With dead ends: 725 [2019-09-20 12:58:25,645 INFO L226 Difference]: Without dead ends: 723 [2019-09-20 12:58:25,646 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2019-09-20 12:58:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-09-20 12:58:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 572. [2019-09-20 12:58:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-20 12:58:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 945 transitions. [2019-09-20 12:58:25,761 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 945 transitions. Word has length 88 [2019-09-20 12:58:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:25,761 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 945 transitions. [2019-09-20 12:58:25,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-20 12:58:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 945 transitions. [2019-09-20 12:58:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 12:58:25,764 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:25,764 INFO L407 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:25,764 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1010237941, now seen corresponding path program 1 times [2019-09-20 12:58:25,765 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:25,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:25,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:58:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-20 12:58:25,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:25,892 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-09-20 12:58:25,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-20 12:58:25,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:26,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-20 12:58:26,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:26,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-09-20 12:58:26,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 12:58:26,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 12:58:26,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:58:26,169 INFO L87 Difference]: Start difference. First operand 572 states and 945 transitions. Second operand 16 states. [2019-09-20 12:58:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:27,975 INFO L93 Difference]: Finished difference Result 906 states and 1490 transitions. [2019-09-20 12:58:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-20 12:58:27,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-20 12:58:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:27,980 INFO L225 Difference]: With dead ends: 906 [2019-09-20 12:58:27,980 INFO L226 Difference]: Without dead ends: 445 [2019-09-20 12:58:27,984 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2019-09-20 12:58:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-09-20 12:58:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 374. [2019-09-20 12:58:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-20 12:58:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 590 transitions. [2019-09-20 12:58:28,076 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 590 transitions. Word has length 88 [2019-09-20 12:58:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:28,077 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 590 transitions. [2019-09-20 12:58:28,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 12:58:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 590 transitions. [2019-09-20 12:58:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 12:58:28,079 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:28,079 INFO L407 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:28,080 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash -16221646, now seen corresponding path program 1 times [2019-09-20 12:58:28,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:28,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:28,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:28,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-20 12:58:28,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:28,205 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:28,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:28,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:58:28,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-09-20 12:58:28,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:28,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-20 12:58:28,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 12:58:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 12:58:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-20 12:58:28,492 INFO L87 Difference]: Start difference. First operand 374 states and 590 transitions. Second operand 19 states. [2019-09-20 12:58:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:33,882 INFO L93 Difference]: Finished difference Result 1284 states and 2060 transitions. [2019-09-20 12:58:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-20 12:58:33,883 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 110 [2019-09-20 12:58:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:33,893 INFO L225 Difference]: With dead ends: 1284 [2019-09-20 12:58:33,894 INFO L226 Difference]: Without dead ends: 969 [2019-09-20 12:58:33,903 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=901, Invalid=4355, Unknown=0, NotChecked=0, Total=5256 [2019-09-20 12:58:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-09-20 12:58:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 616. [2019-09-20 12:58:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-20 12:58:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 998 transitions. [2019-09-20 12:58:34,055 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 998 transitions. Word has length 110 [2019-09-20 12:58:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:34,056 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 998 transitions. [2019-09-20 12:58:34,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 12:58:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 998 transitions. [2019-09-20 12:58:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 12:58:34,060 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:34,061 INFO L407 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:34,061 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1522118384, now seen corresponding path program 1 times [2019-09-20 12:58:34,061 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:34,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:34,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:34,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-20 12:58:34,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:34,134 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-09-20 12:58:34,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:34,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 12:58:34,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:34,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-20 12:58:34,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:34,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-20 12:58:34,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:58:34,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:58:34,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:34,268 INFO L87 Difference]: Start difference. First operand 616 states and 998 transitions. Second operand 10 states. [2019-09-20 12:58:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:34,626 INFO L93 Difference]: Finished difference Result 703 states and 1131 transitions. [2019-09-20 12:58:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:58:34,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-09-20 12:58:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:34,631 INFO L225 Difference]: With dead ends: 703 [2019-09-20 12:58:34,631 INFO L226 Difference]: Without dead ends: 429 [2019-09-20 12:58:34,633 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-09-20 12:58:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-09-20 12:58:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 382. [2019-09-20 12:58:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-20 12:58:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 591 transitions. [2019-09-20 12:58:34,702 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 591 transitions. Word has length 110 [2019-09-20 12:58:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:34,704 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 591 transitions. [2019-09-20 12:58:34,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:58:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 591 transitions. [2019-09-20 12:58:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 12:58:34,706 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:34,706 INFO L407 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:34,706 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:34,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:34,707 INFO L82 PathProgramCache]: Analyzing trace with hash 217536387, now seen corresponding path program 2 times [2019-09-20 12:58:34,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:34,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:34,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-20 12:58:34,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:34,802 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-09-20 12:58:34,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:34,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:34,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:34,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-20 12:58:34,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:34,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-20 12:58:34,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2019-09-20 12:58:34,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 12:58:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 12:58:34,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-20 12:58:34,999 INFO L87 Difference]: Start difference. First operand 382 states and 591 transitions. Second operand 15 states. [2019-09-20 12:58:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:35,973 INFO L93 Difference]: Finished difference Result 577 states and 900 transitions. [2019-09-20 12:58:35,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 12:58:35,974 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2019-09-20 12:58:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:35,977 INFO L225 Difference]: With dead ends: 577 [2019-09-20 12:58:35,977 INFO L226 Difference]: Without dead ends: 465 [2019-09-20 12:58:35,979 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-09-20 12:58:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-20 12:58:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 392. [2019-09-20 12:58:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-20 12:58:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 592 transitions. [2019-09-20 12:58:36,040 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 592 transitions. Word has length 115 [2019-09-20 12:58:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:36,042 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 592 transitions. [2019-09-20 12:58:36,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 12:58:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 592 transitions. [2019-09-20 12:58:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-20 12:58:36,045 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:36,045 INFO L407 BasicCegarLoop]: trace histogram [26, 25, 25, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:36,045 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash 825443435, now seen corresponding path program 2 times [2019-09-20 12:58:36,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:36,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:36,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:36,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:58:36,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 58 proven. 43 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-20 12:58:36,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:36,239 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:36,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:36,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:36,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:36,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-20 12:58:36,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:36,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 60 proven. 41 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-20 12:58:36,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:36,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-20 12:58:36,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-20 12:58:36,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-20 12:58:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-20 12:58:36,587 INFO L87 Difference]: Start difference. First operand 392 states and 592 transitions. Second operand 20 states. [2019-09-20 12:58:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:39,029 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2019-09-20 12:58:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 12:58:39,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 164 [2019-09-20 12:58:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:39,029 INFO L225 Difference]: With dead ends: 495 [2019-09-20 12:58:39,030 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:58:39,032 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=301, Invalid=1031, Unknown=0, NotChecked=0, Total=1332 [2019-09-20 12:58:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:58:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:58:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:58:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:58:39,033 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2019-09-20 12:58:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:39,033 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:58:39,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-20 12:58:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:58:39,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:58:39,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 12:58:39,424 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 278 [2019-09-20 12:58:40,623 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 427 DAG size of output: 402 [2019-09-20 12:58:41,223 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 277 [2019-09-20 12:58:42,164 WARN L191 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 427 DAG size of output: 402 [2019-09-20 12:58:42,570 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 289 [2019-09-20 12:58:42,705 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 234 [2019-09-20 12:58:42,858 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 234 [2019-09-20 12:58:43,399 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 435 [2019-09-20 12:58:43,934 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 439 DAG size of output: 414 [2019-09-20 12:58:44,285 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 418 DAG size of output: 379 [2019-09-20 12:58:45,197 WARN L191 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 607 DAG size of output: 548