/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:04:43,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:04:43,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:04:43,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:04:43,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:04:43,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:04:43,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:04:43,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:04:43,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:04:43,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:04:43,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:04:43,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:04:43,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:04:43,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:04:43,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:04:43,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:04:43,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:04:43,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:04:43,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:04:43,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:04:43,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:04:43,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:04:43,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:04:43,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:04:43,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:04:43,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:04:43,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:04:43,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:04:43,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:04:43,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:04:43,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:04:43,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:04:43,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:04:43,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:04:43,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:04:43,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:04:43,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:04:43,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:04:43,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:04:43,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:04:43,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:04:43,646 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-11-23 21:04:43,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:04:43,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:04:43,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:04:43,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:04:43,662 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:04:43,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:04:43,665 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:04:43,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:04:43,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:04:43,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:04:43,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:04:43,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:04:43,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:04:43,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:04:43,666 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:04:43,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:04:43,667 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:04:43,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:04:43,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:04:43,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:04:43,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:04:43,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:04:43,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:04:43,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:04:43,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:04:43,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:04:43,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:04:43,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:04:43,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:04:43,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:04:43,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:04:43,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:04:43,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:04:43,959 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:04:43,959 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:04:43,960 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label10.c [2019-11-23 21:04:44,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da422cf2/1d07794d38ef4fd3a682e928a6ffee9c/FLAG8f1b9aa15 [2019-11-23 21:04:44,694 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:04:44,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label10.c [2019-11-23 21:04:44,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da422cf2/1d07794d38ef4fd3a682e928a6ffee9c/FLAG8f1b9aa15 [2019-11-23 21:04:44,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da422cf2/1d07794d38ef4fd3a682e928a6ffee9c [2019-11-23 21:04:44,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:04:44,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:04:44,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:04:44,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:04:44,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:04:44,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:04:44" (1/1) ... [2019-11-23 21:04:44,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2c52ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:44, skipping insertion in model container [2019-11-23 21:04:44,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:04:44" (1/1) ... [2019-11-23 21:04:44,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:04:44,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:04:45,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:04:45,706 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:04:46,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:04:46,047 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:04:46,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46 WrapperNode [2019-11-23 21:04:46,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:04:46,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:04:46,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:04:46,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:04:46,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:04:46,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:04:46,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:04:46,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:04:46,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (1/1) ... [2019-11-23 21:04:46,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:04:46,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:04:46,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:04:46,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:04:46,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (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-11-23 21:04:46,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:04:46,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:04:48,331 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:04:48,331 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:04:48,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:04:48 BoogieIcfgContainer [2019-11-23 21:04:48,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:04:48,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:04:48,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:04:48,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:04:48,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:04:44" (1/3) ... [2019-11-23 21:04:48,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74596fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:04:48, skipping insertion in model container [2019-11-23 21:04:48,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:46" (2/3) ... [2019-11-23 21:04:48,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74596fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:04:48, skipping insertion in model container [2019-11-23 21:04:48,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:04:48" (3/3) ... [2019-11-23 21:04:48,346 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label10.c [2019-11-23 21:04:48,357 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:04:48,369 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:04:48,380 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:04:48,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:04:48,424 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:04:48,424 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:04:48,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:04:48,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:04:48,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:04:48,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:04:48,425 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:04:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-23 21:04:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:04:48,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:48,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:48,467 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2019-11-23 21:04:48,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:48,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243804098] [2019-11-23 21:04:48,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:48,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243804098] [2019-11-23 21:04:48,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:48,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:48,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667829739] [2019-11-23 21:04:48,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:48,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:48,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:48,736 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-23 21:04:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:50,949 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-11-23 21:04:50,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:50,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-23 21:04:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:50,971 INFO L225 Difference]: With dead ends: 973 [2019-11-23 21:04:50,972 INFO L226 Difference]: Without dead ends: 607 [2019-11-23 21:04:50,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-23 21:04:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-11-23 21:04:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-23 21:04:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-11-23 21:04:51,063 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 22 [2019-11-23 21:04:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:51,063 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-11-23 21:04:51,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-11-23 21:04:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 21:04:51,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:51,068 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2019-11-23 21:04:51,068 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1871415266, now seen corresponding path program 1 times [2019-11-23 21:04:51,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:51,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292233869] [2019-11-23 21:04:51,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:51,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292233869] [2019-11-23 21:04:51,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:51,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:51,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105169368] [2019-11-23 21:04:51,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:51,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:51,277 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-11-23 21:04:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:53,074 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-11-23 21:04:53,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:53,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-23 21:04:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:53,089 INFO L225 Difference]: With dead ends: 2328 [2019-11-23 21:04:53,089 INFO L226 Difference]: Without dead ends: 1726 [2019-11-23 21:04:53,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-11-23 21:04:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-11-23 21:04:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-23 21:04:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-11-23 21:04:53,154 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 90 [2019-11-23 21:04:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:53,154 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-11-23 21:04:53,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-11-23 21:04:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-23 21:04:53,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:53,160 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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-11-23 21:04:53,160 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:53,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:53,160 INFO L82 PathProgramCache]: Analyzing trace with hash 488148353, now seen corresponding path program 1 times [2019-11-23 21:04:53,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:53,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516092865] [2019-11-23 21:04:53,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:53,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516092865] [2019-11-23 21:04:53,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:53,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:04:53,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385237030] [2019-11-23 21:04:53,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:04:53,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:04:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:04:53,303 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-11-23 21:04:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:54,332 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-11-23 21:04:54,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:04:54,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-23 21:04:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:54,349 INFO L225 Difference]: With dead ends: 4707 [2019-11-23 21:04:54,349 INFO L226 Difference]: Without dead ends: 2999 [2019-11-23 21:04:54,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 21:04:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-11-23 21:04:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-11-23 21:04:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-11-23 21:04:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-11-23 21:04:54,418 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 116 [2019-11-23 21:04:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:54,419 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-11-23 21:04:54,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:04:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-11-23 21:04:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 21:04:54,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:54,433 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:54,433 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:54,434 INFO L82 PathProgramCache]: Analyzing trace with hash 251283053, now seen corresponding path program 1 times [2019-11-23 21:04:54,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:54,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845387411] [2019-11-23 21:04:54,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 21:04:54,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845387411] [2019-11-23 21:04:54,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967787754] [2019-11-23 21:04:54,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:54,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:04:54,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 21:04:54,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:04:54,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 21:04:54,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996747479] [2019-11-23 21:04:54,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:04:54,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:04:54,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:54,860 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-11-23 21:04:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:55,763 INFO L93 Difference]: Finished difference Result 7658 states and 9369 transitions. [2019-11-23 21:04:55,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:04:55,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-23 21:04:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:55,784 INFO L225 Difference]: With dead ends: 7658 [2019-11-23 21:04:55,785 INFO L226 Difference]: Without dead ends: 4661 [2019-11-23 21:04:55,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2019-11-23 21:04:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 4660. [2019-11-23 21:04:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-11-23 21:04:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 5631 transitions. [2019-11-23 21:04:55,875 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 5631 transitions. Word has length 144 [2019-11-23 21:04:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:55,876 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 5631 transitions. [2019-11-23 21:04:55,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:04:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 5631 transitions. [2019-11-23 21:04:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 21:04:55,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:55,879 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 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-11-23 21:04:56,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:56,082 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:56,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2122268031, now seen corresponding path program 1 times [2019-11-23 21:04:56,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:56,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788118390] [2019-11-23 21:04:56,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:56,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788118390] [2019-11-23 21:04:56,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:56,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:56,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084002796] [2019-11-23 21:04:56,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:56,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:56,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:56,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:56,252 INFO L87 Difference]: Start difference. First operand 4660 states and 5631 transitions. Second operand 4 states. [2019-11-23 21:04:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:57,833 INFO L93 Difference]: Finished difference Result 10812 states and 13165 transitions. [2019-11-23 21:04:57,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:57,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-23 21:04:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:57,863 INFO L225 Difference]: With dead ends: 10812 [2019-11-23 21:04:57,863 INFO L226 Difference]: Without dead ends: 6338 [2019-11-23 21:04:57,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2019-11-23 21:04:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5948. [2019-11-23 21:04:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5948 states. [2019-11-23 21:04:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5948 states to 5948 states and 7113 transitions. [2019-11-23 21:04:58,036 INFO L78 Accepts]: Start accepts. Automaton has 5948 states and 7113 transitions. Word has length 149 [2019-11-23 21:04:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:58,037 INFO L462 AbstractCegarLoop]: Abstraction has 5948 states and 7113 transitions. [2019-11-23 21:04:58,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5948 states and 7113 transitions. [2019-11-23 21:04:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-23 21:04:58,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:58,042 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:58,043 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash -205904018, now seen corresponding path program 1 times [2019-11-23 21:04:58,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:58,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240200131] [2019-11-23 21:04:58,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:58,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240200131] [2019-11-23 21:04:58,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:58,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:04:58,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072940465] [2019-11-23 21:04:58,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:58,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:58,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:58,337 INFO L87 Difference]: Start difference. First operand 5948 states and 7113 transitions. Second operand 5 states. [2019-11-23 21:05:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:00,589 INFO L93 Difference]: Finished difference Result 14851 states and 17825 transitions. [2019-11-23 21:05:00,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:05:00,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-11-23 21:05:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:00,624 INFO L225 Difference]: With dead ends: 14851 [2019-11-23 21:05:00,625 INFO L226 Difference]: Without dead ends: 9089 [2019-11-23 21:05:00,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:05:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2019-11-23 21:05:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 7792. [2019-11-23 21:05:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7792 states. [2019-11-23 21:05:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7792 states to 7792 states and 9410 transitions. [2019-11-23 21:05:00,793 INFO L78 Accepts]: Start accepts. Automaton has 7792 states and 9410 transitions. Word has length 234 [2019-11-23 21:05:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:00,793 INFO L462 AbstractCegarLoop]: Abstraction has 7792 states and 9410 transitions. [2019-11-23 21:05:00,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:05:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 7792 states and 9410 transitions. [2019-11-23 21:05:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-23 21:05:00,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:00,804 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-11-23 21:05:00,805 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:00,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:00,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1458513703, now seen corresponding path program 1 times [2019-11-23 21:05:00,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:00,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124012389] [2019-11-23 21:05:00,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:01,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124012389] [2019-11-23 21:05:01,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:05:01,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:05:01,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135390366] [2019-11-23 21:05:01,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:05:01,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:05:01,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:05:01,062 INFO L87 Difference]: Start difference. First operand 7792 states and 9410 transitions. Second operand 4 states. [2019-11-23 21:05:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:02,563 INFO L93 Difference]: Finished difference Result 15396 states and 18626 transitions. [2019-11-23 21:05:02,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:05:02,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-11-23 21:05:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:02,621 INFO L225 Difference]: With dead ends: 15396 [2019-11-23 21:05:02,621 INFO L226 Difference]: Without dead ends: 7790 [2019-11-23 21:05:02,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:05:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-11-23 21:05:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7606. [2019-11-23 21:05:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-11-23 21:05:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 8865 transitions. [2019-11-23 21:05:02,808 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 8865 transitions. Word has length 234 [2019-11-23 21:05:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:02,809 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 8865 transitions. [2019-11-23 21:05:02,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:05:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 8865 transitions. [2019-11-23 21:05:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-23 21:05:02,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:02,818 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-11-23 21:05:02,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash 947970210, now seen corresponding path program 1 times [2019-11-23 21:05:02,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:02,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041127107] [2019-11-23 21:05:02,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 19 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:03,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041127107] [2019-11-23 21:05:03,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526586441] [2019-11-23 21:05:03,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:03,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 21:05:03,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:05:03,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:05:03,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:04,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:04,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:04,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:04,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:04,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 74 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:04,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:05:04,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-23 21:05:04,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999821691] [2019-11-23 21:05:04,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:05:04,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:04,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:05:04,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:05:04,260 INFO L87 Difference]: Start difference. First operand 7606 states and 8865 transitions. Second operand 11 states. [2019-11-23 21:05:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:09,978 INFO L93 Difference]: Finished difference Result 20272 states and 23752 transitions. [2019-11-23 21:05:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:05:09,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2019-11-23 21:05:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:10,001 INFO L225 Difference]: With dead ends: 20272 [2019-11-23 21:05:10,001 INFO L226 Difference]: Without dead ends: 12852 [2019-11-23 21:05:10,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:05:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12852 states. [2019-11-23 21:05:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12852 to 11464. [2019-11-23 21:05:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11464 states. [2019-11-23 21:05:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11464 states to 11464 states and 13099 transitions. [2019-11-23 21:05:10,186 INFO L78 Accepts]: Start accepts. Automaton has 11464 states and 13099 transitions. Word has length 236 [2019-11-23 21:05:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:10,186 INFO L462 AbstractCegarLoop]: Abstraction has 11464 states and 13099 transitions. [2019-11-23 21:05:10,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:05:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 11464 states and 13099 transitions. [2019-11-23 21:05:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-23 21:05:10,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:10,192 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:05:10,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:10,396 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:10,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:10,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1148903582, now seen corresponding path program 1 times [2019-11-23 21:05:10,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:10,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178487752] [2019-11-23 21:05:10,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:10,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178487752] [2019-11-23 21:05:10,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610942727] [2019-11-23 21:05:10,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:11,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 21:05:11,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:05:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:11,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:05:11,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:05:11,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626914784] [2019-11-23 21:05:11,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:05:11,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:05:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:05:11,177 INFO L87 Difference]: Start difference. First operand 11464 states and 13099 transitions. Second operand 4 states. [2019-11-23 21:05:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:12,574 INFO L93 Difference]: Finished difference Result 24401 states and 27912 transitions. [2019-11-23 21:05:12,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:05:12,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-11-23 21:05:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:12,598 INFO L225 Difference]: With dead ends: 24401 [2019-11-23 21:05:12,598 INFO L226 Difference]: Without dead ends: 12939 [2019-11-23 21:05:12,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:05:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12939 states. [2019-11-23 21:05:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12939 to 11094. [2019-11-23 21:05:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11094 states. [2019-11-23 21:05:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11094 states to 11094 states and 12658 transitions. [2019-11-23 21:05:12,838 INFO L78 Accepts]: Start accepts. Automaton has 11094 states and 12658 transitions. Word has length 255 [2019-11-23 21:05:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:12,838 INFO L462 AbstractCegarLoop]: Abstraction has 11094 states and 12658 transitions. [2019-11-23 21:05:12,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:05:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 11094 states and 12658 transitions. [2019-11-23 21:05:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-23 21:05:12,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:12,848 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2019-11-23 21:05:13,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:13,053 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1477636383, now seen corresponding path program 1 times [2019-11-23 21:05:13,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:13,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273701539] [2019-11-23 21:05:13,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 21:05:13,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273701539] [2019-11-23 21:05:13,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:05:13,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:05:13,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479148712] [2019-11-23 21:05:13,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:05:13,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:05:13,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:05:13,310 INFO L87 Difference]: Start difference. First operand 11094 states and 12658 transitions. Second operand 4 states. [2019-11-23 21:05:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:14,933 INFO L93 Difference]: Finished difference Result 24049 states and 27405 transitions. [2019-11-23 21:05:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:05:14,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-11-23 21:05:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:14,954 INFO L225 Difference]: With dead ends: 24049 [2019-11-23 21:05:14,954 INFO L226 Difference]: Without dead ends: 13141 [2019-11-23 21:05:14,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:05:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13141 states. [2019-11-23 21:05:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13141 to 11462. [2019-11-23 21:05:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11462 states. [2019-11-23 21:05:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11462 states to 11462 states and 12860 transitions. [2019-11-23 21:05:15,237 INFO L78 Accepts]: Start accepts. Automaton has 11462 states and 12860 transitions. Word has length 304 [2019-11-23 21:05:15,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:15,237 INFO L462 AbstractCegarLoop]: Abstraction has 11462 states and 12860 transitions. [2019-11-23 21:05:15,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:05:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 11462 states and 12860 transitions. [2019-11-23 21:05:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-23 21:05:15,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:15,253 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2019-11-23 21:05:15,253 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash 56979324, now seen corresponding path program 1 times [2019-11-23 21:05:15,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:15,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834463082] [2019-11-23 21:05:15,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 224 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:15,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834463082] [2019-11-23 21:05:15,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51197655] [2019-11-23 21:05:15,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:15,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:05:15,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:05:15,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:16,159 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 28 [2019-11-23 21:05:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 59 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 21:05:16,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:05:16,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-11-23 21:05:16,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793299698] [2019-11-23 21:05:16,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:05:16,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:16,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:05:16,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:05:16,739 INFO L87 Difference]: Start difference. First operand 11462 states and 12860 transitions. Second operand 9 states. [2019-11-23 21:05:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:25,310 INFO L93 Difference]: Finished difference Result 27175 states and 30424 transitions. [2019-11-23 21:05:25,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:05:25,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 331 [2019-11-23 21:05:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:25,325 INFO L225 Difference]: With dead ends: 27175 [2019-11-23 21:05:25,326 INFO L226 Difference]: Without dead ends: 15347 [2019-11-23 21:05:25,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:05:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15347 states. [2019-11-23 21:05:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15347 to 10909. [2019-11-23 21:05:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10909 states. [2019-11-23 21:05:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10909 states to 10909 states and 12066 transitions. [2019-11-23 21:05:25,490 INFO L78 Accepts]: Start accepts. Automaton has 10909 states and 12066 transitions. Word has length 331 [2019-11-23 21:05:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:25,490 INFO L462 AbstractCegarLoop]: Abstraction has 10909 states and 12066 transitions. [2019-11-23 21:05:25,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:05:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 10909 states and 12066 transitions. [2019-11-23 21:05:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-11-23 21:05:25,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:25,501 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-23 21:05:25,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:25,705 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:25,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash -694285539, now seen corresponding path program 1 times [2019-11-23 21:05:25,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:25,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810870539] [2019-11-23 21:05:25,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 21:05:26,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810870539] [2019-11-23 21:05:26,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:05:26,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:05:26,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290243196] [2019-11-23 21:05:26,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:05:26,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:26,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:05:26,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:05:26,060 INFO L87 Difference]: Start difference. First operand 10909 states and 12066 transitions. Second operand 5 states. [2019-11-23 21:05:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:28,077 INFO L93 Difference]: Finished difference Result 30478 states and 33633 transitions. [2019-11-23 21:05:28,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:05:28,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 349 [2019-11-23 21:05:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:28,094 INFO L225 Difference]: With dead ends: 30478 [2019-11-23 21:05:28,094 INFO L226 Difference]: Without dead ends: 18649 [2019-11-23 21:05:28,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:05:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18649 states. [2019-11-23 21:05:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18649 to 16798. [2019-11-23 21:05:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16798 states. [2019-11-23 21:05:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16798 states to 16798 states and 18332 transitions. [2019-11-23 21:05:28,447 INFO L78 Accepts]: Start accepts. Automaton has 16798 states and 18332 transitions. Word has length 349 [2019-11-23 21:05:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:28,451 INFO L462 AbstractCegarLoop]: Abstraction has 16798 states and 18332 transitions. [2019-11-23 21:05:28,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:05:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 16798 states and 18332 transitions. [2019-11-23 21:05:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-23 21:05:28,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:28,468 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-23 21:05:28,468 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:28,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:28,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1891793115, now seen corresponding path program 1 times [2019-11-23 21:05:28,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:28,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133865212] [2019-11-23 21:05:28,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 89 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:29,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133865212] [2019-11-23 21:05:29,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499512515] [2019-11-23 21:05:29,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:29,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 21:05:29,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:05:29,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:05:29,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:29,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:29,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 157 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:30,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:05:30,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-11-23 21:05:30,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547125020] [2019-11-23 21:05:30,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 21:05:30,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 21:05:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:05:30,044 INFO L87 Difference]: Start difference. First operand 16798 states and 18332 transitions. Second operand 15 states. [2019-11-23 21:05:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:41,026 INFO L93 Difference]: Finished difference Result 33830 states and 36818 transitions. [2019-11-23 21:05:41,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 21:05:41,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 373 [2019-11-23 21:05:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:41,042 INFO L225 Difference]: With dead ends: 33830 [2019-11-23 21:05:41,043 INFO L226 Difference]: Without dead ends: 19060 [2019-11-23 21:05:41,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=472, Invalid=1508, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 21:05:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19060 states. [2019-11-23 21:05:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19060 to 15322. [2019-11-23 21:05:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15322 states. [2019-11-23 21:05:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15322 states to 15322 states and 16687 transitions. [2019-11-23 21:05:41,218 INFO L78 Accepts]: Start accepts. Automaton has 15322 states and 16687 transitions. Word has length 373 [2019-11-23 21:05:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:41,218 INFO L462 AbstractCegarLoop]: Abstraction has 15322 states and 16687 transitions. [2019-11-23 21:05:41,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 21:05:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 15322 states and 16687 transitions. [2019-11-23 21:05:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-11-23 21:05:41,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:41,228 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:05:41,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:41,432 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:41,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:41,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1552182285, now seen corresponding path program 1 times [2019-11-23 21:05:41,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:41,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785776553] [2019-11-23 21:05:41,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 360 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:41,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785776553] [2019-11-23 21:05:41,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487770878] [2019-11-23 21:05:41,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:42,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 21:05:42,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:05:42,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:42,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 149 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:05:43,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:05:43,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-11-23 21:05:43,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306166044] [2019-11-23 21:05:43,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:05:43,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:43,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:05:43,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:05:43,227 INFO L87 Difference]: Start difference. First operand 15322 states and 16687 transitions. Second operand 10 states. [2019-11-23 21:05:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:51,466 INFO L93 Difference]: Finished difference Result 33044 states and 35984 transitions. [2019-11-23 21:05:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:05:51,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 417 [2019-11-23 21:05:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:51,484 INFO L225 Difference]: With dead ends: 33044 [2019-11-23 21:05:51,484 INFO L226 Difference]: Without dead ends: 19382 [2019-11-23 21:05:51,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:05:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19382 states. [2019-11-23 21:05:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19382 to 13478. [2019-11-23 21:05:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13478 states. [2019-11-23 21:05:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13478 states to 13478 states and 14562 transitions. [2019-11-23 21:05:51,655 INFO L78 Accepts]: Start accepts. Automaton has 13478 states and 14562 transitions. Word has length 417 [2019-11-23 21:05:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:51,655 INFO L462 AbstractCegarLoop]: Abstraction has 13478 states and 14562 transitions. [2019-11-23 21:05:51,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:05:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 13478 states and 14562 transitions. [2019-11-23 21:05:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-11-23 21:05:51,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:51,664 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-11-23 21:05:51,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:51,868 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2027911698, now seen corresponding path program 1 times [2019-11-23 21:05:51,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:51,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993171149] [2019-11-23 21:05:51,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-11-23 21:05:52,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993171149] [2019-11-23 21:05:52,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:05:52,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:05:52,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634087776] [2019-11-23 21:05:52,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:05:52,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:52,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:05:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:05:52,225 INFO L87 Difference]: Start difference. First operand 13478 states and 14562 transitions. Second operand 3 states. [2019-11-23 21:05:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:05:53,203 INFO L93 Difference]: Finished difference Result 26584 states and 28655 transitions. [2019-11-23 21:05:53,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:05:53,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-11-23 21:05:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:05:53,217 INFO L225 Difference]: With dead ends: 26584 [2019-11-23 21:05:53,218 INFO L226 Difference]: Without dead ends: 14582 [2019-11-23 21:05:53,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:05:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14582 states. [2019-11-23 21:05:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14582 to 12740. [2019-11-23 21:05:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12740 states. [2019-11-23 21:05:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12740 states to 12740 states and 13712 transitions. [2019-11-23 21:05:53,385 INFO L78 Accepts]: Start accepts. Automaton has 12740 states and 13712 transitions. Word has length 417 [2019-11-23 21:05:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:05:53,386 INFO L462 AbstractCegarLoop]: Abstraction has 12740 states and 13712 transitions. [2019-11-23 21:05:53,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:05:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 12740 states and 13712 transitions. [2019-11-23 21:05:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-11-23 21:05:53,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:05:53,401 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:05:53,401 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:05:53,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:05:53,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1498430217, now seen corresponding path program 1 times [2019-11-23 21:05:53,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:05:53,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210239817] [2019-11-23 21:05:53,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:05:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 859 proven. 20 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-23 21:05:54,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210239817] [2019-11-23 21:05:54,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035012524] [2019-11-23 21:05:54,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:05:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:05:54,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:05:54,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:05:54,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:54,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:54,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:54,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:54,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:05:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 697 proven. 440 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 21:05:55,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:05:55,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-23 21:05:55,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501645130] [2019-11-23 21:05:55,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:05:55,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:05:55,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:05:55,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:05:55,928 INFO L87 Difference]: Start difference. First operand 12740 states and 13712 transitions. Second operand 11 states. [2019-11-23 21:06:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:03,899 INFO L93 Difference]: Finished difference Result 27149 states and 29197 transitions. [2019-11-23 21:06:03,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:06:03,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 701 [2019-11-23 21:06:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:03,900 INFO L225 Difference]: With dead ends: 27149 [2019-11-23 21:06:03,900 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:06:03,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:06:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:06:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:06:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:06:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:06:03,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 701 [2019-11-23 21:06:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:03,912 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:06:03,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:06:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:06:03,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:06:04,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:06:04,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:06:05,698 WARN L192 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 797 DAG size of output: 521 [2019-11-23 21:06:06,720 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 791 DAG size of output: 518