/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/Problem16_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:20:43,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:20:43,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:20:43,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:20:43,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:20:43,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:20:43,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:20:43,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:20:43,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:20:43,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:20:43,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:20:43,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:20:43,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:20:43,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:20:43,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:20:43,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:20:43,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:20:43,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:20:43,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:20:43,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:20:43,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:20:43,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:20:43,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:20:43,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:20:43,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:20:43,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:20:43,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:20:43,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:20:43,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:20:43,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:20:43,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:20:43,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:20:43,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:20:43,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:20:43,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:20:43,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:20:43,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:20:43,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:20:43,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:20:43,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:20:43,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:20:43,200 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:20:43,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:20:43,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:20:43,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:20:43,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:20:43,238 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:20:43,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:20:43,238 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:20:43,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:20:43,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:20:43,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:20:43,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:20:43,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:20:43,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:20:43,239 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:20:43,240 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:20:43,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:20:43,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:20:43,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:20:43,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:20:43,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:20:43,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:20:43,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:20:43,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:20:43,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:20:43,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:20:43,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:20:43,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:20:43,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:20:43,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:20:43,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:20:43,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:20:43,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:20:43,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:20:43,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:20:43,523 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:20:43,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label53.c [2019-11-23 21:20:43,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dbf8cb0/85ad10ef22bc40eaabefc3f9e93f73df/FLAGce44f6f8e [2019-11-23 21:20:44,250 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:20:44,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label53.c [2019-11-23 21:20:44,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dbf8cb0/85ad10ef22bc40eaabefc3f9e93f73df/FLAGce44f6f8e [2019-11-23 21:20:44,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dbf8cb0/85ad10ef22bc40eaabefc3f9e93f73df [2019-11-23 21:20:44,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:20:44,487 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:20:44,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:20:44,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:20:44,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:20:44,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:44" (1/1) ... [2019-11-23 21:20:44,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7059378e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:44, skipping insertion in model container [2019-11-23 21:20:44,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:44" (1/1) ... [2019-11-23 21:20:44,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:20:44,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:20:45,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:20:45,346 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:20:45,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:20:45,744 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:20:45,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45 WrapperNode [2019-11-23 21:20:45,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:20:45,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:20:45,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:20:45,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:20:45,758 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:20:45" (1/1) ... [2019-11-23 21:20:45,803 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:20:45" (1/1) ... [2019-11-23 21:20:45,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:20:45,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:20:45,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:20:45,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:20:45,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (1/1) ... [2019-11-23 21:20:45,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (1/1) ... [2019-11-23 21:20:45,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (1/1) ... [2019-11-23 21:20:45,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (1/1) ... [2019-11-23 21:20:46,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (1/1) ... [2019-11-23 21:20:46,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (1/1) ... [2019-11-23 21:20:46,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (1/1) ... [2019-11-23 21:20:46,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:20:46,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:20:46,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:20:46,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:20:46,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (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:20:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:20:46,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:20:48,605 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:20:48,606 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 21:20:48,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:48 BoogieIcfgContainer [2019-11-23 21:20:48,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:20:48,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:20:48,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:20:48,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:20:48,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:20:44" (1/3) ... [2019-11-23 21:20:48,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249aaa03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:48, skipping insertion in model container [2019-11-23 21:20:48,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:45" (2/3) ... [2019-11-23 21:20:48,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249aaa03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:48, skipping insertion in model container [2019-11-23 21:20:48,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:48" (3/3) ... [2019-11-23 21:20:48,615 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label53.c [2019-11-23 21:20:48,627 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:20:48,637 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:20:48,649 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:20:48,694 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:20:48,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:20:48,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:20:48,695 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:20:48,695 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:20:48,696 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:20:48,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:20:48,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:20:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-11-23 21:20:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 21:20:48,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:20:48,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:20:48,728 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:20:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:20:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-11-23 21:20:48,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:20:48,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174667239] [2019-11-23 21:20:48,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:20:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:20:49,020 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:20:49,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174667239] [2019-11-23 21:20:49,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:20:49,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:20:49,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124059420] [2019-11-23 21:20:49,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:20:49,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:20:49,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:20:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:20:49,047 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-11-23 21:20:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:20:52,728 INFO L93 Difference]: Finished difference Result 1454 states and 2762 transitions. [2019-11-23 21:20:52,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:20:52,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-23 21:20:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:20:52,757 INFO L225 Difference]: With dead ends: 1454 [2019-11-23 21:20:52,757 INFO L226 Difference]: Without dead ends: 991 [2019-11-23 21:20:52,763 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:20:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-23 21:20:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-23 21:20:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-23 21:20:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1615 transitions. [2019-11-23 21:20:52,900 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1615 transitions. Word has length 37 [2019-11-23 21:20:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:20:52,901 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1615 transitions. [2019-11-23 21:20:52,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:20:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1615 transitions. [2019-11-23 21:20:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-23 21:20:52,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:20:52,912 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:20:52,912 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:20:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:20:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1477322986, now seen corresponding path program 1 times [2019-11-23 21:20:52,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:20:52,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841493988] [2019-11-23 21:20:52,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:20:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:20:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 21:20:53,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841493988] [2019-11-23 21:20:53,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:20:53,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:20:53,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3088610] [2019-11-23 21:20:53,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:20:53,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:20:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:20:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:20:53,164 INFO L87 Difference]: Start difference. First operand 991 states and 1615 transitions. Second operand 5 states. [2019-11-23 21:20:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:20:56,656 INFO L93 Difference]: Finished difference Result 2309 states and 3677 transitions. [2019-11-23 21:20:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:20:56,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2019-11-23 21:20:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:20:56,665 INFO L225 Difference]: With dead ends: 2309 [2019-11-23 21:20:56,665 INFO L226 Difference]: Without dead ends: 1320 [2019-11-23 21:20:56,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:20:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-11-23 21:20:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2019-11-23 21:20:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-11-23 21:20:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1866 transitions. [2019-11-23 21:20:56,750 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1866 transitions. Word has length 196 [2019-11-23 21:20:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:20:56,750 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1866 transitions. [2019-11-23 21:20:56,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:20:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1866 transitions. [2019-11-23 21:20:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-23 21:20:56,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:20:56,757 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:20:56,757 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:20:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:20:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2098910767, now seen corresponding path program 1 times [2019-11-23 21:20:56,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:20:56,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046567795] [2019-11-23 21:20:56,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:20:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:20:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 21:20:56,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046567795] [2019-11-23 21:20:56,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:20:56,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:20:56,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531649449] [2019-11-23 21:20:56,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:20:56,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:20:56,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:20:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:20:56,950 INFO L87 Difference]: Start difference. First operand 1320 states and 1866 transitions. Second operand 4 states. [2019-11-23 21:21:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:00,606 INFO L93 Difference]: Finished difference Result 4941 states and 6928 transitions. [2019-11-23 21:21:00,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:21:00,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-23 21:21:00,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:00,624 INFO L225 Difference]: With dead ends: 4941 [2019-11-23 21:21:00,624 INFO L226 Difference]: Without dead ends: 3623 [2019-11-23 21:21:00,627 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:21:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2019-11-23 21:21:00,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623. [2019-11-23 21:21:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2019-11-23 21:21:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4625 transitions. [2019-11-23 21:21:00,702 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4625 transitions. Word has length 197 [2019-11-23 21:21:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:00,703 INFO L462 AbstractCegarLoop]: Abstraction has 3623 states and 4625 transitions. [2019-11-23 21:21:00,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:21:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4625 transitions. [2019-11-23 21:21:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-23 21:21:00,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:00,725 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:21:00,726 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:00,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash -912780600, now seen corresponding path program 1 times [2019-11-23 21:21:00,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:00,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108028729] [2019-11-23 21:21:00,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-23 21:21:01,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108028729] [2019-11-23 21:21:01,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:01,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:21:01,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673644631] [2019-11-23 21:21:01,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:21:01,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:01,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:21:01,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:21:01,211 INFO L87 Difference]: Start difference. First operand 3623 states and 4625 transitions. Second operand 3 states. [2019-11-23 21:21:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:03,127 INFO L93 Difference]: Finished difference Result 8889 states and 11524 transitions. [2019-11-23 21:21:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:21:03,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-23 21:21:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:03,152 INFO L225 Difference]: With dead ends: 8889 [2019-11-23 21:21:03,152 INFO L226 Difference]: Without dead ends: 5268 [2019-11-23 21:21:03,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 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:21:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2019-11-23 21:21:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 3952. [2019-11-23 21:21:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-11-23 21:21:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5003 transitions. [2019-11-23 21:21:03,233 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5003 transitions. Word has length 300 [2019-11-23 21:21:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:03,234 INFO L462 AbstractCegarLoop]: Abstraction has 3952 states and 5003 transitions. [2019-11-23 21:21:03,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:21:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5003 transitions. [2019-11-23 21:21:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-11-23 21:21:03,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:03,245 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 21:21:03,245 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2049856684, now seen corresponding path program 1 times [2019-11-23 21:21:03,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:03,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310147945] [2019-11-23 21:21:03,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-11-23 21:21:03,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310147945] [2019-11-23 21:21:03,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:03,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:21:03,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426733348] [2019-11-23 21:21:03,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:21:03,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:21:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:21:03,771 INFO L87 Difference]: Start difference. First operand 3952 states and 5003 transitions. Second operand 4 states. [2019-11-23 21:21:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:07,011 INFO L93 Difference]: Finished difference Result 14811 states and 18613 transitions. [2019-11-23 21:21:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:21:07,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2019-11-23 21:21:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:07,058 INFO L225 Difference]: With dead ends: 14811 [2019-11-23 21:21:07,058 INFO L226 Difference]: Without dead ends: 10861 [2019-11-23 21:21:07,064 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:21:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-11-23 21:21:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 7242. [2019-11-23 21:21:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7242 states. [2019-11-23 21:21:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 9061 transitions. [2019-11-23 21:21:07,194 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 9061 transitions. Word has length 466 [2019-11-23 21:21:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:07,195 INFO L462 AbstractCegarLoop]: Abstraction has 7242 states and 9061 transitions. [2019-11-23 21:21:07,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:21:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 9061 transitions. [2019-11-23 21:21:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-23 21:21:07,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:07,208 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 21:21:07,209 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash -486035987, now seen corresponding path program 1 times [2019-11-23 21:21:07,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:07,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471427328] [2019-11-23 21:21:07,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-23 21:21:08,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471427328] [2019-11-23 21:21:08,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:08,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:21:08,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801532480] [2019-11-23 21:21:08,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:21:08,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:08,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:21:08,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:21:08,315 INFO L87 Difference]: Start difference. First operand 7242 states and 9061 transitions. Second operand 7 states. [2019-11-23 21:21:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:13,434 INFO L93 Difference]: Finished difference Result 14813 states and 18463 transitions. [2019-11-23 21:21:13,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:21:13,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 505 [2019-11-23 21:21:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:13,470 INFO L225 Difference]: With dead ends: 14813 [2019-11-23 21:21:13,471 INFO L226 Difference]: Without dead ends: 7573 [2019-11-23 21:21:13,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:21:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-11-23 21:21:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7571. [2019-11-23 21:21:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-23 21:21:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 9396 transitions. [2019-11-23 21:21:13,656 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 9396 transitions. Word has length 505 [2019-11-23 21:21:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:13,658 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 9396 transitions. [2019-11-23 21:21:13,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:21:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 9396 transitions. [2019-11-23 21:21:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2019-11-23 21:21:13,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:13,678 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 21:21:13,678 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1206968833, now seen corresponding path program 1 times [2019-11-23 21:21:13,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:13,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288456763] [2019-11-23 21:21:13,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-11-23 21:21:14,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288456763] [2019-11-23 21:21:14,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:14,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:21:14,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889731933] [2019-11-23 21:21:14,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:21:14,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:21:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:21:14,388 INFO L87 Difference]: Start difference. First operand 7571 states and 9396 transitions. Second operand 7 states. [2019-11-23 21:21:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:17,467 INFO L93 Difference]: Finished difference Result 14999 states and 18643 transitions. [2019-11-23 21:21:17,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:21:17,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 592 [2019-11-23 21:21:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:17,483 INFO L225 Difference]: With dead ends: 14999 [2019-11-23 21:21:17,483 INFO L226 Difference]: Without dead ends: 7571 [2019-11-23 21:21:17,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:21:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-11-23 21:21:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2019-11-23 21:21:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-23 21:21:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8226 transitions. [2019-11-23 21:21:17,576 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8226 transitions. Word has length 592 [2019-11-23 21:21:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:17,577 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 8226 transitions. [2019-11-23 21:21:17,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:21:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8226 transitions. [2019-11-23 21:21:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2019-11-23 21:21:17,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:17,586 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-23 21:21:17,586 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1851622877, now seen corresponding path program 1 times [2019-11-23 21:21:17,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:17,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629691397] [2019-11-23 21:21:17,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-23 21:21:18,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629691397] [2019-11-23 21:21:18,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:18,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:21:18,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888741214] [2019-11-23 21:21:18,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:21:18,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:18,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:21:18,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:21:18,029 INFO L87 Difference]: Start difference. First operand 7571 states and 8226 transitions. Second operand 4 states. [2019-11-23 21:21:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:20,300 INFO L93 Difference]: Finished difference Result 17114 states and 18620 transitions. [2019-11-23 21:21:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:21:20,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 620 [2019-11-23 21:21:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:20,320 INFO L225 Difference]: With dead ends: 17114 [2019-11-23 21:21:20,321 INFO L226 Difference]: Without dead ends: 9874 [2019-11-23 21:21:20,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:21:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9874 states. [2019-11-23 21:21:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9874 to 9216. [2019-11-23 21:21:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9216 states. [2019-11-23 21:21:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9845 transitions. [2019-11-23 21:21:20,449 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9845 transitions. Word has length 620 [2019-11-23 21:21:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:20,450 INFO L462 AbstractCegarLoop]: Abstraction has 9216 states and 9845 transitions. [2019-11-23 21:21:20,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:21:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9845 transitions. [2019-11-23 21:21:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2019-11-23 21:21:20,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:20,469 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:21:20,470 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:20,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:20,470 INFO L82 PathProgramCache]: Analyzing trace with hash 920429046, now seen corresponding path program 1 times [2019-11-23 21:21:20,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:20,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243932031] [2019-11-23 21:21:20,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 875 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-23 21:21:21,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243932031] [2019-11-23 21:21:21,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:21,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:21:21,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443532973] [2019-11-23 21:21:21,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:21:21,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:21:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:21:21,124 INFO L87 Difference]: Start difference. First operand 9216 states and 9845 transitions. Second operand 4 states. [2019-11-23 21:21:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:23,203 INFO L93 Difference]: Finished difference Result 20733 states and 22166 transitions. [2019-11-23 21:21:23,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:21:23,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 782 [2019-11-23 21:21:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:23,220 INFO L225 Difference]: With dead ends: 20733 [2019-11-23 21:21:23,220 INFO L226 Difference]: Without dead ends: 11848 [2019-11-23 21:21:23,230 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:21:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2019-11-23 21:21:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 10861. [2019-11-23 21:21:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-11-23 21:21:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11439 transitions. [2019-11-23 21:21:23,380 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11439 transitions. Word has length 782 [2019-11-23 21:21:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:23,381 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 11439 transitions. [2019-11-23 21:21:23,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:21:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11439 transitions. [2019-11-23 21:21:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2019-11-23 21:21:23,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:23,405 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:21:23,406 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash -573342841, now seen corresponding path program 1 times [2019-11-23 21:21:23,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:23,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605986155] [2019-11-23 21:21:23,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2045 backedges. 1273 proven. 6 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2019-11-23 21:21:24,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605986155] [2019-11-23 21:21:24,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504840905] [2019-11-23 21:21:24,623 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:21:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:24,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:21:24,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:21:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2045 backedges. 1273 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2019-11-23 21:21:25,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:21:25,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 21:21:25,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064994816] [2019-11-23 21:21:25,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:21:25,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:25,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:21:25,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:21:25,611 INFO L87 Difference]: Start difference. First operand 10861 states and 11439 transitions. Second operand 3 states. [2019-11-23 21:21:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:26,862 INFO L93 Difference]: Finished difference Result 25339 states and 26718 transitions. [2019-11-23 21:21:26,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:21:26,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1060 [2019-11-23 21:21:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:26,888 INFO L225 Difference]: With dead ends: 25339 [2019-11-23 21:21:26,890 INFO L226 Difference]: Without dead ends: 13164 [2019-11-23 21:21:26,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 1060 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:21:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-11-23 21:21:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12506. [2019-11-23 21:21:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-11-23 21:21:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13060 transitions. [2019-11-23 21:21:27,106 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13060 transitions. Word has length 1060 [2019-11-23 21:21:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:27,108 INFO L462 AbstractCegarLoop]: Abstraction has 12506 states and 13060 transitions. [2019-11-23 21:21:27,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:21:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13060 transitions. [2019-11-23 21:21:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1576 [2019-11-23 21:21:27,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:27,142 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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:21:27,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:21:27,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash -147486429, now seen corresponding path program 1 times [2019-11-23 21:21:27,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:27,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109100852] [2019-11-23 21:21:27,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4451 backedges. 3102 proven. 0 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2019-11-23 21:21:30,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109100852] [2019-11-23 21:21:30,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:30,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:21:30,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082555143] [2019-11-23 21:21:30,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:21:30,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:30,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:21:30,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:21:30,704 INFO L87 Difference]: Start difference. First operand 12506 states and 13060 transitions. Second operand 6 states. [2019-11-23 21:21:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:33,684 INFO L93 Difference]: Finished difference Result 25348 states and 26472 transitions. [2019-11-23 21:21:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:21:33,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1575 [2019-11-23 21:21:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:33,705 INFO L225 Difference]: With dead ends: 25348 [2019-11-23 21:21:33,705 INFO L226 Difference]: Without dead ends: 13173 [2019-11-23 21:21:33,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:21:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13173 states. [2019-11-23 21:21:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13173 to 12835. [2019-11-23 21:21:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12835 states. [2019-11-23 21:21:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13395 transitions. [2019-11-23 21:21:33,862 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13395 transitions. Word has length 1575 [2019-11-23 21:21:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:33,864 INFO L462 AbstractCegarLoop]: Abstraction has 12835 states and 13395 transitions. [2019-11-23 21:21:33,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:21:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13395 transitions. [2019-11-23 21:21:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1787 [2019-11-23 21:21:33,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:33,907 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:21:33,908 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:33,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1060144217, now seen corresponding path program 1 times [2019-11-23 21:21:33,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:33,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645388728] [2019-11-23 21:21:33,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6345 backedges. 1303 proven. 0 refuted. 0 times theorem prover too weak. 5042 trivial. 0 not checked. [2019-11-23 21:21:36,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645388728] [2019-11-23 21:21:36,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:36,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:21:36,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460777337] [2019-11-23 21:21:36,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:21:36,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:36,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:21:36,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:21:36,626 INFO L87 Difference]: Start difference. First operand 12835 states and 13395 transitions. Second operand 5 states. [2019-11-23 21:21:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:39,253 INFO L93 Difference]: Finished difference Result 32577 states and 33988 transitions. [2019-11-23 21:21:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:21:39,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1786 [2019-11-23 21:21:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:39,277 INFO L225 Difference]: With dead ends: 32577 [2019-11-23 21:21:39,277 INFO L226 Difference]: Without dead ends: 20073 [2019-11-23 21:21:39,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:21:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2019-11-23 21:21:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 18428. [2019-11-23 21:21:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18428 states. [2019-11-23 21:21:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 19137 transitions. [2019-11-23 21:21:39,544 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 19137 transitions. Word has length 1786 [2019-11-23 21:21:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:39,545 INFO L462 AbstractCegarLoop]: Abstraction has 18428 states and 19137 transitions. [2019-11-23 21:21:39,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:21:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 19137 transitions. [2019-11-23 21:21:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1832 [2019-11-23 21:21:39,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:39,608 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:39,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:39,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash -470441397, now seen corresponding path program 1 times [2019-11-23 21:21:39,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:39,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098273710] [2019-11-23 21:21:39,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 4214 proven. 0 refuted. 0 times theorem prover too weak. 1836 trivial. 0 not checked. [2019-11-23 21:21:43,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098273710] [2019-11-23 21:21:43,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:43,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 21:21:43,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478736820] [2019-11-23 21:21:43,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:21:43,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:43,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:21:43,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:21:43,674 INFO L87 Difference]: Start difference. First operand 18428 states and 19137 transitions. Second operand 7 states. [2019-11-23 21:21:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:48,303 INFO L93 Difference]: Finished difference Result 40222 states and 41836 transitions. [2019-11-23 21:21:48,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:21:48,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1831 [2019-11-23 21:21:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:48,330 INFO L225 Difference]: With dead ends: 40222 [2019-11-23 21:21:48,330 INFO L226 Difference]: Without dead ends: 22125 [2019-11-23 21:21:48,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:21:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22125 states. [2019-11-23 21:21:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22125 to 21169. [2019-11-23 21:21:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21169 states. [2019-11-23 21:21:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21169 states to 21169 states and 21801 transitions. [2019-11-23 21:21:48,606 INFO L78 Accepts]: Start accepts. Automaton has 21169 states and 21801 transitions. Word has length 1831 [2019-11-23 21:21:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:48,607 INFO L462 AbstractCegarLoop]: Abstraction has 21169 states and 21801 transitions. [2019-11-23 21:21:48,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:21:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 21169 states and 21801 transitions. [2019-11-23 21:21:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1884 [2019-11-23 21:21:48,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:48,647 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:21:48,647 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:48,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:48,648 INFO L82 PathProgramCache]: Analyzing trace with hash 319086325, now seen corresponding path program 1 times [2019-11-23 21:21:48,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:48,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178571834] [2019-11-23 21:21:48,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6998 backedges. 1317 proven. 0 refuted. 0 times theorem prover too weak. 5681 trivial. 0 not checked. [2019-11-23 21:21:51,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178571834] [2019-11-23 21:21:51,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:51,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:21:51,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418848617] [2019-11-23 21:21:51,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:21:51,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:21:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:21:51,477 INFO L87 Difference]: Start difference. First operand 21169 states and 21801 transitions. Second operand 5 states. [2019-11-23 21:21:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:21:53,788 INFO L93 Difference]: Finished difference Result 44885 states and 46204 transitions. [2019-11-23 21:21:53,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:21:53,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1883 [2019-11-23 21:21:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:21:53,809 INFO L225 Difference]: With dead ends: 44885 [2019-11-23 21:21:53,809 INFO L226 Difference]: Without dead ends: 24047 [2019-11-23 21:21:53,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:21:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24047 states. [2019-11-23 21:21:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24047 to 21169. [2019-11-23 21:21:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21169 states. [2019-11-23 21:21:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21169 states to 21169 states and 21801 transitions. [2019-11-23 21:21:54,029 INFO L78 Accepts]: Start accepts. Automaton has 21169 states and 21801 transitions. Word has length 1883 [2019-11-23 21:21:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:21:54,030 INFO L462 AbstractCegarLoop]: Abstraction has 21169 states and 21801 transitions. [2019-11-23 21:21:54,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:21:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 21169 states and 21801 transitions. [2019-11-23 21:21:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2307 [2019-11-23 21:21:54,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:21:54,070 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:54,070 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:21:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:21:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1738237066, now seen corresponding path program 1 times [2019-11-23 21:21:54,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:21:54,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099979217] [2019-11-23 21:21:54,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:21:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:21:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9385 backedges. 7092 proven. 0 refuted. 0 times theorem prover too weak. 2293 trivial. 0 not checked. [2019-11-23 21:21:58,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099979217] [2019-11-23 21:21:58,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:21:58,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 21:21:58,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311582152] [2019-11-23 21:21:58,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:21:58,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:21:58,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:21:58,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:21:58,598 INFO L87 Difference]: Start difference. First operand 21169 states and 21801 transitions. Second operand 7 states.