/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/Problem15_label23.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:14:23,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:14:23,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:14:23,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:14:23,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:14:23,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:14:23,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:14:23,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:14:23,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:14:23,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:14:23,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:14:23,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:14:23,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:14:23,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:14:23,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:14:23,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:14:23,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:14:23,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:14:23,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:14:23,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:14:23,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:14:23,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:14:23,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:14:23,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:14:23,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:14:23,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:14:23,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:14:23,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:14:23,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:14:23,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:14:23,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:14:23,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:14:23,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:14:23,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:14:23,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:14:23,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:14:23,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:14:23,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:14:23,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:14:23,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:14:23,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:14:23,692 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:14:23,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:14:23,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:14:23,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:14:23,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:14:23,727 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:14:23,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:14:23,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:14:23,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:14:23,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:14:23,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:14:23,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:14:23,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:14:23,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:14:23,728 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:14:23,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:14:23,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:14:23,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:14:23,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:14:23,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:14:23,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:14:23,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:14:23,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:14:23,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:14:23,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:14:23,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:14:23,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:14:23,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:14:23,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:14:23,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:14:23,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:14:24,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:14:24,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:14:24,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:14:24,065 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:14:24,066 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:14:24,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label23.c [2019-11-23 21:14:24,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5660a21c/81d9835a21c64951bacabe0c1d3ff8ef/FLAGe011f12fa [2019-11-23 21:14:24,830 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:14:24,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label23.c [2019-11-23 21:14:24,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5660a21c/81d9835a21c64951bacabe0c1d3ff8ef/FLAGe011f12fa [2019-11-23 21:14:25,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5660a21c/81d9835a21c64951bacabe0c1d3ff8ef [2019-11-23 21:14:25,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:14:25,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:14:25,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:14:25,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:14:25,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:14:25,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:14:25" (1/1) ... [2019-11-23 21:14:25,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705ef929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:25, skipping insertion in model container [2019-11-23 21:14:25,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:14:25" (1/1) ... [2019-11-23 21:14:25,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:14:25,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:14:26,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:14:26,075 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:14:26,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:14:26,479 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:14:26,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26 WrapperNode [2019-11-23 21:14:26,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:14:26,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:14:26,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:14:26,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:14:26,490 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:14:26" (1/1) ... [2019-11-23 21:14:26,539 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:14:26" (1/1) ... [2019-11-23 21:14:26,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:14:26,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:14:26,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:14:26,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:14:26,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (1/1) ... [2019-11-23 21:14:26,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (1/1) ... [2019-11-23 21:14:26,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (1/1) ... [2019-11-23 21:14:26,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (1/1) ... [2019-11-23 21:14:26,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (1/1) ... [2019-11-23 21:14:26,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (1/1) ... [2019-11-23 21:14:26,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (1/1) ... [2019-11-23 21:14:27,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:14:27,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:14:27,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:14:27,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:14:27,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (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:14:27,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:14:27,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:14:32,973 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:14:32,973 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 21:14:32,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:14:32 BoogieIcfgContainer [2019-11-23 21:14:32,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:14:32,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:14:32,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:14:32,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:14:32,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:14:25" (1/3) ... [2019-11-23 21:14:32,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3272cf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:14:32, skipping insertion in model container [2019-11-23 21:14:32,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:14:26" (2/3) ... [2019-11-23 21:14:32,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3272cf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:14:32, skipping insertion in model container [2019-11-23 21:14:32,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:14:32" (3/3) ... [2019-11-23 21:14:32,984 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label23.c [2019-11-23 21:14:32,994 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:14:33,004 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:14:33,016 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:14:33,061 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:14:33,061 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:14:33,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:14:33,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:14:33,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:14:33,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:14:33,063 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:14:33,063 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:14:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-23 21:14:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 21:14:33,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:33,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:14:33,105 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash 156847385, now seen corresponding path program 1 times [2019-11-23 21:14:33,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:33,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584596149] [2019-11-23 21:14:33,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:33,392 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:14:33,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584596149] [2019-11-23 21:14:33,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:33,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:14:33,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398800715] [2019-11-23 21:14:33,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:33,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:33,421 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-23 21:14:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:38,468 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-11-23 21:14:38,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:38,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 21:14:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:38,497 INFO L225 Difference]: With dead ends: 1514 [2019-11-23 21:14:38,497 INFO L226 Difference]: Without dead ends: 1008 [2019-11-23 21:14:38,503 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:14:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-23 21:14:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-11-23 21:14:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-23 21:14:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-11-23 21:14:38,604 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 17 [2019-11-23 21:14:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:38,604 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-11-23 21:14:38,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-11-23 21:14:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 21:14:38,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:38,609 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:14:38,609 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash 848677887, now seen corresponding path program 1 times [2019-11-23 21:14:38,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:38,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133561627] [2019-11-23 21:14:38,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:14:38,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133561627] [2019-11-23 21:14:38,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:38,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:14:38,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097506359] [2019-11-23 21:14:38,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:38,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:38,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:38,812 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 4 states. [2019-11-23 21:14:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:42,860 INFO L93 Difference]: Finished difference Result 2564 states and 4456 transitions. [2019-11-23 21:14:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:42,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-23 21:14:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:42,871 INFO L225 Difference]: With dead ends: 2564 [2019-11-23 21:14:42,872 INFO L226 Difference]: Without dead ends: 1889 [2019-11-23 21:14:42,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:14:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-23 21:14:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1884. [2019-11-23 21:14:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2019-11-23 21:14:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2869 transitions. [2019-11-23 21:14:42,936 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2869 transitions. Word has length 82 [2019-11-23 21:14:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:42,936 INFO L462 AbstractCegarLoop]: Abstraction has 1884 states and 2869 transitions. [2019-11-23 21:14:42,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2869 transitions. [2019-11-23 21:14:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 21:14:42,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:42,946 INFO L410 BasicCegarLoop]: trace histogram [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, 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:14:42,946 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1334121405, now seen corresponding path program 1 times [2019-11-23 21:14:42,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:42,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070676412] [2019-11-23 21:14:42,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:14:43,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070676412] [2019-11-23 21:14:43,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:43,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:14:43,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103371696] [2019-11-23 21:14:43,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:43,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:43,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:43,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:43,218 INFO L87 Difference]: Start difference. First operand 1884 states and 2869 transitions. Second operand 4 states. [2019-11-23 21:14:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:47,354 INFO L93 Difference]: Finished difference Result 6196 states and 9426 transitions. [2019-11-23 21:14:47,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:47,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-23 21:14:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:47,379 INFO L225 Difference]: With dead ends: 6196 [2019-11-23 21:14:47,380 INFO L226 Difference]: Without dead ends: 4314 [2019-11-23 21:14:47,383 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:14:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2019-11-23 21:14:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4287. [2019-11-23 21:14:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-23 21:14:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6169 transitions. [2019-11-23 21:14:47,574 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6169 transitions. Word has length 163 [2019-11-23 21:14:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:47,579 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6169 transitions. [2019-11-23 21:14:47,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6169 transitions. [2019-11-23 21:14:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-23 21:14:47,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:47,590 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:14:47,590 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1334395021, now seen corresponding path program 1 times [2019-11-23 21:14:47,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:47,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128297468] [2019-11-23 21:14:47,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 21:14:47,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128297468] [2019-11-23 21:14:47,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:47,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:14:47,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881658852] [2019-11-23 21:14:47,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:47,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:47,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:47,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:47,757 INFO L87 Difference]: Start difference. First operand 4287 states and 6169 transitions. Second operand 4 states. [2019-11-23 21:14:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:51,292 INFO L93 Difference]: Finished difference Result 14558 states and 20924 transitions. [2019-11-23 21:14:51,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:51,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-23 21:14:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:51,336 INFO L225 Difference]: With dead ends: 14558 [2019-11-23 21:14:51,336 INFO L226 Difference]: Without dead ends: 10273 [2019-11-23 21:14:51,343 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:14:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10273 states. [2019-11-23 21:14:51,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10273 to 6081. [2019-11-23 21:14:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6081 states. [2019-11-23 21:14:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6081 states to 6081 states and 8211 transitions. [2019-11-23 21:14:51,495 INFO L78 Accepts]: Start accepts. Automaton has 6081 states and 8211 transitions. Word has length 182 [2019-11-23 21:14:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:51,496 INFO L462 AbstractCegarLoop]: Abstraction has 6081 states and 8211 transitions. [2019-11-23 21:14:51,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6081 states and 8211 transitions. [2019-11-23 21:14:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-11-23 21:14:51,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:51,501 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:51,502 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1534843702, now seen corresponding path program 1 times [2019-11-23 21:14:51,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:51,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335638050] [2019-11-23 21:14:51,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 21:14:52,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335638050] [2019-11-23 21:14:52,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408552391] [2019-11-23 21:14:52,054 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:14:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:52,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:14:52,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:14:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 21:14:52,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:14:52,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 21:14:52,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99855838] [2019-11-23 21:14:52,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:14:52,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:52,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:14:52,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:52,384 INFO L87 Difference]: Start difference. First operand 6081 states and 8211 transitions. Second operand 3 states. [2019-11-23 21:14:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:55,021 INFO L93 Difference]: Finished difference Result 13958 states and 18569 transitions. [2019-11-23 21:14:55,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:14:55,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-11-23 21:14:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:55,056 INFO L225 Difference]: With dead ends: 13958 [2019-11-23 21:14:55,056 INFO L226 Difference]: Without dead ends: 7879 [2019-11-23 21:14:55,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 287 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:14:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-11-23 21:14:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7279. [2019-11-23 21:14:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7279 states. [2019-11-23 21:14:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7279 states to 7279 states and 9554 transitions. [2019-11-23 21:14:55,229 INFO L78 Accepts]: Start accepts. Automaton has 7279 states and 9554 transitions. Word has length 287 [2019-11-23 21:14:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:55,230 INFO L462 AbstractCegarLoop]: Abstraction has 7279 states and 9554 transitions. [2019-11-23 21:14:55,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:14:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7279 states and 9554 transitions. [2019-11-23 21:14:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-23 21:14:55,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:55,245 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2019-11-23 21:14:55,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:55,460 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash 414059792, now seen corresponding path program 1 times [2019-11-23 21:14:55,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:55,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531264080] [2019-11-23 21:14:55,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 21:14:56,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531264080] [2019-11-23 21:14:56,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:56,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:14:56,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301491902] [2019-11-23 21:14:56,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:14:56,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:14:56,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:14:56,177 INFO L87 Difference]: Start difference. First operand 7279 states and 9554 transitions. Second operand 5 states. [2019-11-23 21:15:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:00,645 INFO L93 Difference]: Finished difference Result 15156 states and 19731 transitions. [2019-11-23 21:15:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:15:00,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 375 [2019-11-23 21:15:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:00,669 INFO L225 Difference]: With dead ends: 15156 [2019-11-23 21:15:00,669 INFO L226 Difference]: Without dead ends: 7879 [2019-11-23 21:15:00,675 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:15:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-11-23 21:15:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7578. [2019-11-23 21:15:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7578 states. [2019-11-23 21:15:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 9841 transitions. [2019-11-23 21:15:00,838 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 9841 transitions. Word has length 375 [2019-11-23 21:15:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:00,838 INFO L462 AbstractCegarLoop]: Abstraction has 7578 states and 9841 transitions. [2019-11-23 21:15:00,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:15:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 9841 transitions. [2019-11-23 21:15:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-11-23 21:15:00,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:00,858 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:00,858 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1298660331, now seen corresponding path program 1 times [2019-11-23 21:15:00,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:00,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347308191] [2019-11-23 21:15:00,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 21:15:01,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347308191] [2019-11-23 21:15:01,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:01,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:01,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223366048] [2019-11-23 21:15:01,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:01,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:01,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:01,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:01,189 INFO L87 Difference]: Start difference. First operand 7578 states and 9841 transitions. Second operand 3 states. [2019-11-23 21:15:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:05,121 INFO L93 Difference]: Finished difference Result 19339 states and 25072 transitions. [2019-11-23 21:15:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:05,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 378 [2019-11-23 21:15:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:05,142 INFO L225 Difference]: With dead ends: 19339 [2019-11-23 21:15:05,142 INFO L226 Difference]: Without dead ends: 11763 [2019-11-23 21:15:05,149 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:15:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11763 states. [2019-11-23 21:15:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11763 to 8472. [2019-11-23 21:15:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8472 states. [2019-11-23 21:15:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8472 states to 8472 states and 11000 transitions. [2019-11-23 21:15:05,280 INFO L78 Accepts]: Start accepts. Automaton has 8472 states and 11000 transitions. Word has length 378 [2019-11-23 21:15:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:05,280 INFO L462 AbstractCegarLoop]: Abstraction has 8472 states and 11000 transitions. [2019-11-23 21:15:05,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8472 states and 11000 transitions. [2019-11-23 21:15:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-23 21:15:05,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:05,289 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:05,289 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:05,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1983745662, now seen corresponding path program 1 times [2019-11-23 21:15:05,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:05,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497863854] [2019-11-23 21:15:05,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:05,853 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:15:05,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497863854] [2019-11-23 21:15:05,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:05,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:15:05,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786965193] [2019-11-23 21:15:05,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:15:05,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:15:05,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:15:05,857 INFO L87 Difference]: Start difference. First operand 8472 states and 11000 transitions. Second operand 6 states. [2019-11-23 21:15:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:10,018 INFO L93 Difference]: Finished difference Result 17946 states and 23138 transitions. [2019-11-23 21:15:10,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:15:10,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 382 [2019-11-23 21:15:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:10,036 INFO L225 Difference]: With dead ends: 17946 [2019-11-23 21:15:10,036 INFO L226 Difference]: Without dead ends: 9476 [2019-11-23 21:15:10,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:15:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2019-11-23 21:15:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 8468. [2019-11-23 21:15:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8468 states. [2019-11-23 21:15:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 10235 transitions. [2019-11-23 21:15:10,183 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 10235 transitions. Word has length 382 [2019-11-23 21:15:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:10,184 INFO L462 AbstractCegarLoop]: Abstraction has 8468 states and 10235 transitions. [2019-11-23 21:15:10,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:15:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 10235 transitions. [2019-11-23 21:15:10,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-11-23 21:15:10,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:10,197 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:15:10,197 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:10,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1769213182, now seen corresponding path program 1 times [2019-11-23 21:15:10,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:10,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143523286] [2019-11-23 21:15:10,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-11-23 21:15:10,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143523286] [2019-11-23 21:15:10,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:10,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:15:10,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555670387] [2019-11-23 21:15:10,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:15:10,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:10,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:15:10,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:15:10,763 INFO L87 Difference]: Start difference. First operand 8468 states and 10235 transitions. Second operand 4 states. [2019-11-23 21:15:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:14,223 INFO L93 Difference]: Finished difference Result 22317 states and 27759 transitions. [2019-11-23 21:15:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:15:14,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 476 [2019-11-23 21:15:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:14,250 INFO L225 Difference]: With dead ends: 22317 [2019-11-23 21:15:14,250 INFO L226 Difference]: Without dead ends: 13851 [2019-11-23 21:15:14,260 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:15:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13851 states. [2019-11-23 21:15:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13851 to 12653. [2019-11-23 21:15:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12653 states. [2019-11-23 21:15:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 15146 transitions. [2019-11-23 21:15:14,450 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 15146 transitions. Word has length 476 [2019-11-23 21:15:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:14,451 INFO L462 AbstractCegarLoop]: Abstraction has 12653 states and 15146 transitions. [2019-11-23 21:15:14,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:15:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 15146 transitions. [2019-11-23 21:15:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-11-23 21:15:14,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:14,458 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:14,459 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1320773207, now seen corresponding path program 1 times [2019-11-23 21:15:14,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:14,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656068366] [2019-11-23 21:15:14,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 21:15:15,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656068366] [2019-11-23 21:15:15,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:15,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:15:15,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435801681] [2019-11-23 21:15:15,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:15:15,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:15,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:15:15,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:15:15,021 INFO L87 Difference]: Start difference. First operand 12653 states and 15146 transitions. Second operand 4 states. [2019-11-23 21:15:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:18,262 INFO L93 Difference]: Finished difference Result 25306 states and 30314 transitions. [2019-11-23 21:15:18,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:15:18,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 477 [2019-11-23 21:15:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:18,278 INFO L225 Difference]: With dead ends: 25306 [2019-11-23 21:15:18,278 INFO L226 Difference]: Without dead ends: 12655 [2019-11-23 21:15:18,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 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:15:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12655 states. [2019-11-23 21:15:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12655 to 12649. [2019-11-23 21:15:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12649 states. [2019-11-23 21:15:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12649 states to 12649 states and 14509 transitions. [2019-11-23 21:15:18,524 INFO L78 Accepts]: Start accepts. Automaton has 12649 states and 14509 transitions. Word has length 477 [2019-11-23 21:15:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:18,525 INFO L462 AbstractCegarLoop]: Abstraction has 12649 states and 14509 transitions. [2019-11-23 21:15:18,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:15:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12649 states and 14509 transitions. [2019-11-23 21:15:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-11-23 21:15:18,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:18,542 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:18,543 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1954143259, now seen corresponding path program 1 times [2019-11-23 21:15:18,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:18,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570932715] [2019-11-23 21:15:18,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-23 21:15:18,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570932715] [2019-11-23 21:15:18,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:18,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:18,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550305924] [2019-11-23 21:15:18,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:18,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:18,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:18,989 INFO L87 Difference]: Start difference. First operand 12649 states and 14509 transitions. Second operand 3 states. [2019-11-23 21:15:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:21,732 INFO L93 Difference]: Finished difference Result 29480 states and 33620 transitions. [2019-11-23 21:15:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:21,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 586 [2019-11-23 21:15:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:21,748 INFO L225 Difference]: With dead ends: 29480 [2019-11-23 21:15:21,749 INFO L226 Difference]: Without dead ends: 12946 [2019-11-23 21:15:21,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12946 states. [2019-11-23 21:15:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12946 to 11150. [2019-11-23 21:15:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-11-23 21:15:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 11829 transitions. [2019-11-23 21:15:21,870 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 11829 transitions. Word has length 586 [2019-11-23 21:15:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:21,871 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 11829 transitions. [2019-11-23 21:15:21,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 11829 transitions. [2019-11-23 21:15:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2019-11-23 21:15:21,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:21,879 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:21,879 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash 607182036, now seen corresponding path program 1 times [2019-11-23 21:15:21,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:21,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751817738] [2019-11-23 21:15:21,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-11-23 21:15:22,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751817738] [2019-11-23 21:15:22,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:22,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:22,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861750893] [2019-11-23 21:15:22,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:22,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:22,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:22,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:22,241 INFO L87 Difference]: Start difference. First operand 11150 states and 11829 transitions. Second operand 3 states. [2019-11-23 21:15:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:23,634 INFO L93 Difference]: Finished difference Result 22595 states and 23976 transitions. [2019-11-23 21:15:23,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:23,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 614 [2019-11-23 21:15:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:23,645 INFO L225 Difference]: With dead ends: 22595 [2019-11-23 21:15:23,646 INFO L226 Difference]: Without dead ends: 11447 [2019-11-23 21:15:23,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11447 states. [2019-11-23 21:15:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11447 to 11148. [2019-11-23 21:15:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11148 states. [2019-11-23 21:15:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11148 states to 11148 states and 11825 transitions. [2019-11-23 21:15:23,786 INFO L78 Accepts]: Start accepts. Automaton has 11148 states and 11825 transitions. Word has length 614 [2019-11-23 21:15:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:23,787 INFO L462 AbstractCegarLoop]: Abstraction has 11148 states and 11825 transitions. [2019-11-23 21:15:23,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 11148 states and 11825 transitions. [2019-11-23 21:15:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-11-23 21:15:23,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:23,806 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 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:15:23,806 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1120513970, now seen corresponding path program 1 times [2019-11-23 21:15:23,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:23,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639652372] [2019-11-23 21:15:23,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 21:15:24,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639652372] [2019-11-23 21:15:24,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:24,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:24,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660196715] [2019-11-23 21:15:24,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:24,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:24,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:24,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:24,771 INFO L87 Difference]: Start difference. First operand 11148 states and 11825 transitions. Second operand 3 states. [2019-11-23 21:15:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:26,205 INFO L93 Difference]: Finished difference Result 26480 states and 28086 transitions. [2019-11-23 21:15:26,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:26,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-11-23 21:15:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:26,222 INFO L225 Difference]: With dead ends: 26480 [2019-11-23 21:15:26,223 INFO L226 Difference]: Without dead ends: 15334 [2019-11-23 21:15:26,231 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:15:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15334 states. [2019-11-23 21:15:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15334 to 13540. [2019-11-23 21:15:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13540 states. [2019-11-23 21:15:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13540 states to 13540 states and 14335 transitions. [2019-11-23 21:15:26,374 INFO L78 Accepts]: Start accepts. Automaton has 13540 states and 14335 transitions. Word has length 683 [2019-11-23 21:15:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:26,375 INFO L462 AbstractCegarLoop]: Abstraction has 13540 states and 14335 transitions. [2019-11-23 21:15:26,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 13540 states and 14335 transitions. [2019-11-23 21:15:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2019-11-23 21:15:26,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:26,389 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:26,389 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash -480038149, now seen corresponding path program 1 times [2019-11-23 21:15:26,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:26,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351784939] [2019-11-23 21:15:26,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2019-11-23 21:15:26,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351784939] [2019-11-23 21:15:26,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:26,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:26,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067068563] [2019-11-23 21:15:26,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:15:26,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:15:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:26,903 INFO L87 Difference]: Start difference. First operand 13540 states and 14335 transitions. Second operand 3 states. [2019-11-23 21:15:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:28,299 INFO L93 Difference]: Finished difference Result 29169 states and 30887 transitions. [2019-11-23 21:15:28,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:15:28,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 699 [2019-11-23 21:15:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:28,314 INFO L225 Difference]: With dead ends: 29169 [2019-11-23 21:15:28,314 INFO L226 Difference]: Without dead ends: 15332 [2019-11-23 21:15:28,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:15:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15332 states. [2019-11-23 21:15:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15332 to 15033. [2019-11-23 21:15:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15033 states. [2019-11-23 21:15:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15033 states to 15033 states and 15726 transitions. [2019-11-23 21:15:28,478 INFO L78 Accepts]: Start accepts. Automaton has 15033 states and 15726 transitions. Word has length 699 [2019-11-23 21:15:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:28,479 INFO L462 AbstractCegarLoop]: Abstraction has 15033 states and 15726 transitions. [2019-11-23 21:15:28,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:15:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 15033 states and 15726 transitions. [2019-11-23 21:15:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-11-23 21:15:28,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:28,498 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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, 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] [2019-11-23 21:15:28,498 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2028888827, now seen corresponding path program 1 times [2019-11-23 21:15:28,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:28,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239278732] [2019-11-23 21:15:28,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 638 proven. 188 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 21:15:30,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239278732] [2019-11-23 21:15:30,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240133396] [2019-11-23 21:15:30,862 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:15:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:31,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:15:31,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:15:31,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:15:31,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:31,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:31,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:31,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:31,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:15:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 668 proven. 76 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-23 21:15:32,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:15:32,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2019-11-23 21:15:32,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312117984] [2019-11-23 21:15:32,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:15:32,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:32,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:15:32,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:15:32,836 INFO L87 Difference]: Start difference. First operand 15033 states and 15726 transitions. Second operand 11 states. [2019-11-23 21:15:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:15:40,726 INFO L93 Difference]: Finished difference Result 34573 states and 36101 transitions. [2019-11-23 21:15:40,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 21:15:40,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 841 [2019-11-23 21:15:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:15:40,744 INFO L225 Difference]: With dead ends: 34573 [2019-11-23 21:15:40,744 INFO L226 Difference]: Without dead ends: 19542 [2019-11-23 21:15:40,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 848 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:15:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19542 states. [2019-11-23 21:15:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19542 to 15631. [2019-11-23 21:15:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15631 states. [2019-11-23 21:15:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15631 states to 15631 states and 16328 transitions. [2019-11-23 21:15:40,985 INFO L78 Accepts]: Start accepts. Automaton has 15631 states and 16328 transitions. Word has length 841 [2019-11-23 21:15:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:15:40,985 INFO L462 AbstractCegarLoop]: Abstraction has 15631 states and 16328 transitions. [2019-11-23 21:15:40,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:15:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15631 states and 16328 transitions. [2019-11-23 21:15:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2019-11-23 21:15:40,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:40,999 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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:15:41,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:15:41,201 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:41,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1556688105, now seen corresponding path program 1 times [2019-11-23 21:15:41,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:41,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360290127] [2019-11-23 21:15:41,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 543 proven. 198 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-23 21:15:42,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360290127] [2019-11-23 21:15:42,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779546272] [2019-11-23 21:15:42,896 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:15:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:43,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 21:15:43,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:15:43,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms