/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/systemc/token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:49:13,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:49:13,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:49:13,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:49:13,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:49:13,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:49:13,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:49:13,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:49:13,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:49:13,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:49:13,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:49:13,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:49:13,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:49:13,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:49:13,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:49:13,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:49:13,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:49:13,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:49:13,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:49:13,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:49:13,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:49:13,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:49:13,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:49:13,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:49:13,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:49:13,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:49:13,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:49:13,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:49:13,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:49:13,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:49:13,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:49:13,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:49:13,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:49:13,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:49:13,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:49:13,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:49:13,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:49:13,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:49:13,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:49:13,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:49:13,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:49:13,316 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 22:49:13,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:49:13,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:49:13,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:49:13,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:49:13,333 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:49:13,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:49:13,333 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:49:13,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:49:13,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:49:13,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:49:13,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:49:13,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:49:13,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:49:13,335 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:49:13,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:49:13,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:49:13,335 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:49:13,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:49:13,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:49:13,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:49:13,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:49:13,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:49:13,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:49:13,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:49:13,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:49:13,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:49:13,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:49:13,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:49:13,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:49:13,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:49:13,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:49:13,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:49:13,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:49:13,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:49:13,657 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:49:13,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-11-23 22:49:13,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc70d516/fee6f2907e7742d69a86f22d0b826e2e/FLAG7008ed9ff [2019-11-23 22:49:14,264 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:49:14,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-11-23 22:49:14,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc70d516/fee6f2907e7742d69a86f22d0b826e2e/FLAG7008ed9ff [2019-11-23 22:49:14,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc70d516/fee6f2907e7742d69a86f22d0b826e2e [2019-11-23 22:49:14,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:49:14,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:49:14,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:14,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:49:14,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:49:14,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:14" (1/1) ... [2019-11-23 22:49:14,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcfe516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:14, skipping insertion in model container [2019-11-23 22:49:14,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:49:14" (1/1) ... [2019-11-23 22:49:14,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:49:14,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:49:14,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:14,871 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:49:15,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:49:15,042 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:49:15,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15 WrapperNode [2019-11-23 22:49:15,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:49:15,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:15,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:49:15,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:49:15,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:49:15,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:49:15,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:49:15,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:49:15,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (1/1) ... [2019-11-23 22:49:15,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:49:15,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:49:15,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:49:15,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:49:15,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (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 22:49:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:49:15,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:49:16,323 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:49:16,324 INFO L284 CfgBuilder]: Removed 130 assume(true) statements. [2019-11-23 22:49:16,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:16 BoogieIcfgContainer [2019-11-23 22:49:16,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:49:16,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:49:16,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:49:16,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:49:16,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:49:14" (1/3) ... [2019-11-23 22:49:16,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96e692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:16, skipping insertion in model container [2019-11-23 22:49:16,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:49:15" (2/3) ... [2019-11-23 22:49:16,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96e692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:49:16, skipping insertion in model container [2019-11-23 22:49:16,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:49:16" (3/3) ... [2019-11-23 22:49:16,337 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2019-11-23 22:49:16,345 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:49:16,351 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:49:16,364 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:49:16,395 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:49:16,395 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:49:16,395 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:49:16,395 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:49:16,396 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:49:16,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:49:16,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:49:16,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:49:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2019-11-23 22:49:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:16,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:16,437 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, 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 22:49:16,437 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1976596934, now seen corresponding path program 1 times [2019-11-23 22:49:16,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:16,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713643055] [2019-11-23 22:49:16,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:16,639 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 22:49:16,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713643055] [2019-11-23 22:49:16,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:16,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:16,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540095256] [2019-11-23 22:49:16,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:16,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:16,666 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 3 states. [2019-11-23 22:49:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:16,753 INFO L93 Difference]: Finished difference Result 613 states and 955 transitions. [2019-11-23 22:49:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:16,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:16,782 INFO L225 Difference]: With dead ends: 613 [2019-11-23 22:49:16,782 INFO L226 Difference]: Without dead ends: 305 [2019-11-23 22:49:16,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-23 22:49:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-23 22:49:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-23 22:49:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 463 transitions. [2019-11-23 22:49:16,885 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 463 transitions. Word has length 61 [2019-11-23 22:49:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:16,886 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 463 transitions. [2019-11-23 22:49:16,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 463 transitions. [2019-11-23 22:49:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:16,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:16,891 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, 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 22:49:16,891 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:16,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:16,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1057453112, now seen corresponding path program 1 times [2019-11-23 22:49:16,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:16,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014200786] [2019-11-23 22:49:16,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:16,965 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 22:49:16,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014200786] [2019-11-23 22:49:16,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:16,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:16,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284017799] [2019-11-23 22:49:16,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:16,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:16,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:16,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:16,972 INFO L87 Difference]: Start difference. First operand 305 states and 463 transitions. Second operand 3 states. [2019-11-23 22:49:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:17,052 INFO L93 Difference]: Finished difference Result 827 states and 1253 transitions. [2019-11-23 22:49:17,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:17,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:17,056 INFO L225 Difference]: With dead ends: 827 [2019-11-23 22:49:17,057 INFO L226 Difference]: Without dead ends: 530 [2019-11-23 22:49:17,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-23 22:49:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2019-11-23 22:49:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 22:49:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 797 transitions. [2019-11-23 22:49:17,096 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 797 transitions. Word has length 61 [2019-11-23 22:49:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:17,096 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 797 transitions. [2019-11-23 22:49:17,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 797 transitions. [2019-11-23 22:49:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:17,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:17,099 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, 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 22:49:17,103 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:17,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1933472118, now seen corresponding path program 1 times [2019-11-23 22:49:17,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:17,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194182572] [2019-11-23 22:49:17,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:17,187 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 22:49:17,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194182572] [2019-11-23 22:49:17,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:17,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:17,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675459910] [2019-11-23 22:49:17,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:17,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:17,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,192 INFO L87 Difference]: Start difference. First operand 528 states and 797 transitions. Second operand 3 states. [2019-11-23 22:49:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:17,243 INFO L93 Difference]: Finished difference Result 1047 states and 1581 transitions. [2019-11-23 22:49:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:17,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:17,249 INFO L225 Difference]: With dead ends: 1047 [2019-11-23 22:49:17,249 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:49:17,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:49:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 22:49:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 22:49:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 789 transitions. [2019-11-23 22:49:17,289 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 789 transitions. Word has length 61 [2019-11-23 22:49:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:17,290 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 789 transitions. [2019-11-23 22:49:17,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 789 transitions. [2019-11-23 22:49:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:17,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:17,292 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, 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 22:49:17,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:17,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1494892678, now seen corresponding path program 1 times [2019-11-23 22:49:17,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:17,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688237698] [2019-11-23 22:49:17,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:17,354 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 22:49:17,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688237698] [2019-11-23 22:49:17,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:17,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:17,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429559436] [2019-11-23 22:49:17,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:17,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,357 INFO L87 Difference]: Start difference. First operand 528 states and 789 transitions. Second operand 3 states. [2019-11-23 22:49:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:17,393 INFO L93 Difference]: Finished difference Result 1046 states and 1564 transitions. [2019-11-23 22:49:17,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:17,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:17,396 INFO L225 Difference]: With dead ends: 1046 [2019-11-23 22:49:17,396 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:49:17,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:49:17,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 22:49:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 22:49:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 781 transitions. [2019-11-23 22:49:17,424 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 781 transitions. Word has length 61 [2019-11-23 22:49:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:17,426 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 781 transitions. [2019-11-23 22:49:17,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 781 transitions. [2019-11-23 22:49:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:17,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:17,429 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, 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 22:49:17,430 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash -774201098, now seen corresponding path program 1 times [2019-11-23 22:49:17,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:17,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619997251] [2019-11-23 22:49:17,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:17,507 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 22:49:17,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619997251] [2019-11-23 22:49:17,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:17,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:17,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162836612] [2019-11-23 22:49:17,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:17,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,511 INFO L87 Difference]: Start difference. First operand 528 states and 781 transitions. Second operand 3 states. [2019-11-23 22:49:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:17,572 INFO L93 Difference]: Finished difference Result 1045 states and 1547 transitions. [2019-11-23 22:49:17,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:17,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:17,576 INFO L225 Difference]: With dead ends: 1045 [2019-11-23 22:49:17,577 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:49:17,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:49:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 22:49:17,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 22:49:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 773 transitions. [2019-11-23 22:49:17,605 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 773 transitions. Word has length 61 [2019-11-23 22:49:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:17,605 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 773 transitions. [2019-11-23 22:49:17,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 773 transitions. [2019-11-23 22:49:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:17,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:17,612 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, 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 22:49:17,612 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:17,613 INFO L82 PathProgramCache]: Analyzing trace with hash -196763654, now seen corresponding path program 1 times [2019-11-23 22:49:17,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:17,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444788916] [2019-11-23 22:49:17,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:17,676 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 22:49:17,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444788916] [2019-11-23 22:49:17,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:17,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:17,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041819719] [2019-11-23 22:49:17,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:17,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:17,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:17,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,681 INFO L87 Difference]: Start difference. First operand 528 states and 773 transitions. Second operand 3 states. [2019-11-23 22:49:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:17,766 INFO L93 Difference]: Finished difference Result 1044 states and 1530 transitions. [2019-11-23 22:49:17,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:17,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:17,769 INFO L225 Difference]: With dead ends: 1044 [2019-11-23 22:49:17,770 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:49:17,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:49:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 22:49:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 22:49:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 755 transitions. [2019-11-23 22:49:17,795 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 755 transitions. Word has length 61 [2019-11-23 22:49:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:17,795 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 755 transitions. [2019-11-23 22:49:17,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 755 transitions. [2019-11-23 22:49:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:17,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:17,799 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, 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 22:49:17,799 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:17,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:17,799 INFO L82 PathProgramCache]: Analyzing trace with hash 749500983, now seen corresponding path program 1 times [2019-11-23 22:49:17,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:17,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448931801] [2019-11-23 22:49:17,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:17,866 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 22:49:17,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448931801] [2019-11-23 22:49:17,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:17,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:17,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450285985] [2019-11-23 22:49:17,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:17,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:17,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:17,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,874 INFO L87 Difference]: Start difference. First operand 528 states and 755 transitions. Second operand 3 states. [2019-11-23 22:49:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:17,934 INFO L93 Difference]: Finished difference Result 1042 states and 1491 transitions. [2019-11-23 22:49:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:17,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:17,938 INFO L225 Difference]: With dead ends: 1042 [2019-11-23 22:49:17,938 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:49:17,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:49:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 22:49:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 22:49:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 737 transitions. [2019-11-23 22:49:17,962 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 737 transitions. Word has length 61 [2019-11-23 22:49:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:17,962 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 737 transitions. [2019-11-23 22:49:17,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 737 transitions. [2019-11-23 22:49:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:17,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:17,963 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, 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 22:49:17,964 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:17,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:17,964 INFO L82 PathProgramCache]: Analyzing trace with hash 91036916, now seen corresponding path program 1 times [2019-11-23 22:49:17,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:17,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092282516] [2019-11-23 22:49:17,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:17,998 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 22:49:17,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092282516] [2019-11-23 22:49:17,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:17,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:17,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710935896] [2019-11-23 22:49:17,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:17,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:18,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:18,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,000 INFO L87 Difference]: Start difference. First operand 528 states and 737 transitions. Second operand 3 states. [2019-11-23 22:49:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:18,050 INFO L93 Difference]: Finished difference Result 1041 states and 1454 transitions. [2019-11-23 22:49:18,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:18,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:18,054 INFO L225 Difference]: With dead ends: 1041 [2019-11-23 22:49:18,054 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:49:18,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:49:18,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 22:49:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 22:49:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 719 transitions. [2019-11-23 22:49:18,077 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 719 transitions. Word has length 61 [2019-11-23 22:49:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:18,077 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 719 transitions. [2019-11-23 22:49:18,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 719 transitions. [2019-11-23 22:49:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:18,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:18,078 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, 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 22:49:18,079 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1080534521, now seen corresponding path program 1 times [2019-11-23 22:49:18,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:18,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326371519] [2019-11-23 22:49:18,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:18,118 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 22:49:18,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326371519] [2019-11-23 22:49:18,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:18,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:18,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138109277] [2019-11-23 22:49:18,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:18,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,120 INFO L87 Difference]: Start difference. First operand 528 states and 719 transitions. Second operand 3 states. [2019-11-23 22:49:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:18,175 INFO L93 Difference]: Finished difference Result 1043 states and 1421 transitions. [2019-11-23 22:49:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:18,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:18,178 INFO L225 Difference]: With dead ends: 1043 [2019-11-23 22:49:18,178 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 22:49:18,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 22:49:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 22:49:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 22:49:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 701 transitions. [2019-11-23 22:49:18,202 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 701 transitions. Word has length 61 [2019-11-23 22:49:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:18,202 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 701 transitions. [2019-11-23 22:49:18,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 701 transitions. [2019-11-23 22:49:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:49:18,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:18,203 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, 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 22:49:18,204 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash -507813381, now seen corresponding path program 1 times [2019-11-23 22:49:18,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:18,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98249852] [2019-11-23 22:49:18,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:18,245 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 22:49:18,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98249852] [2019-11-23 22:49:18,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:18,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:18,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259372032] [2019-11-23 22:49:18,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:18,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,248 INFO L87 Difference]: Start difference. First operand 528 states and 701 transitions. Second operand 3 states. [2019-11-23 22:49:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:18,344 INFO L93 Difference]: Finished difference Result 1498 states and 1997 transitions. [2019-11-23 22:49:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:18,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:49:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:18,351 INFO L225 Difference]: With dead ends: 1498 [2019-11-23 22:49:18,351 INFO L226 Difference]: Without dead ends: 987 [2019-11-23 22:49:18,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-11-23 22:49:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 935. [2019-11-23 22:49:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-11-23 22:49:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1235 transitions. [2019-11-23 22:49:18,402 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1235 transitions. Word has length 61 [2019-11-23 22:49:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:18,408 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1235 transitions. [2019-11-23 22:49:18,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1235 transitions. [2019-11-23 22:49:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:49:18,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:18,411 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:18,411 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1762264897, now seen corresponding path program 1 times [2019-11-23 22:49:18,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:18,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473786358] [2019-11-23 22:49:18,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:18,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473786358] [2019-11-23 22:49:18,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:18,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:18,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124936166] [2019-11-23 22:49:18,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:18,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:18,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,502 INFO L87 Difference]: Start difference. First operand 935 states and 1235 transitions. Second operand 3 states. [2019-11-23 22:49:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:18,618 INFO L93 Difference]: Finished difference Result 2677 states and 3550 transitions. [2019-11-23 22:49:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:18,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:49:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:18,630 INFO L225 Difference]: With dead ends: 2677 [2019-11-23 22:49:18,630 INFO L226 Difference]: Without dead ends: 1765 [2019-11-23 22:49:18,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-23 22:49:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1679. [2019-11-23 22:49:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2019-11-23 22:49:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2213 transitions. [2019-11-23 22:49:18,715 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2213 transitions. Word has length 99 [2019-11-23 22:49:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:18,715 INFO L462 AbstractCegarLoop]: Abstraction has 1679 states and 2213 transitions. [2019-11-23 22:49:18,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2213 transitions. [2019-11-23 22:49:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:49:18,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:18,718 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:18,718 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:18,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash 185707138, now seen corresponding path program 1 times [2019-11-23 22:49:18,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:18,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121109338] [2019-11-23 22:49:18,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:18,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121109338] [2019-11-23 22:49:18,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:18,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:18,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843073615] [2019-11-23 22:49:18,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:18,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:18,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:18,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,773 INFO L87 Difference]: Start difference. First operand 1679 states and 2213 transitions. Second operand 3 states. [2019-11-23 22:49:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:18,961 INFO L93 Difference]: Finished difference Result 4813 states and 6315 transitions. [2019-11-23 22:49:18,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:18,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:49:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:18,978 INFO L225 Difference]: With dead ends: 4813 [2019-11-23 22:49:18,979 INFO L226 Difference]: Without dead ends: 3183 [2019-11-23 22:49:18,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2019-11-23 22:49:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3113. [2019-11-23 22:49:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2019-11-23 22:49:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 4039 transitions. [2019-11-23 22:49:19,110 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 4039 transitions. Word has length 99 [2019-11-23 22:49:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:19,111 INFO L462 AbstractCegarLoop]: Abstraction has 3113 states and 4039 transitions. [2019-11-23 22:49:19,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 4039 transitions. [2019-11-23 22:49:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:49:19,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:19,114 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:19,115 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:19,115 INFO L82 PathProgramCache]: Analyzing trace with hash -233004503, now seen corresponding path program 1 times [2019-11-23 22:49:19,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:19,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072985360] [2019-11-23 22:49:19,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:19,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072985360] [2019-11-23 22:49:19,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:19,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:19,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213525363] [2019-11-23 22:49:19,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:19,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:19,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:19,157 INFO L87 Difference]: Start difference. First operand 3113 states and 4039 transitions. Second operand 3 states. [2019-11-23 22:49:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:19,454 INFO L93 Difference]: Finished difference Result 8892 states and 11507 transitions. [2019-11-23 22:49:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:19,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:49:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:19,479 INFO L225 Difference]: With dead ends: 8892 [2019-11-23 22:49:19,480 INFO L226 Difference]: Without dead ends: 5828 [2019-11-23 22:49:19,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2019-11-23 22:49:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 5666. [2019-11-23 22:49:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5666 states. [2019-11-23 22:49:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5666 states to 5666 states and 7277 transitions. [2019-11-23 22:49:19,707 INFO L78 Accepts]: Start accepts. Automaton has 5666 states and 7277 transitions. Word has length 100 [2019-11-23 22:49:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:19,707 INFO L462 AbstractCegarLoop]: Abstraction has 5666 states and 7277 transitions. [2019-11-23 22:49:19,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5666 states and 7277 transitions. [2019-11-23 22:49:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:49:19,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:19,711 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:19,712 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1938307367, now seen corresponding path program 1 times [2019-11-23 22:49:19,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:19,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091245363] [2019-11-23 22:49:19,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:19,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091245363] [2019-11-23 22:49:19,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:19,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:19,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647471298] [2019-11-23 22:49:19,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:19,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:19,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:19,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:19,742 INFO L87 Difference]: Start difference. First operand 5666 states and 7277 transitions. Second operand 3 states. [2019-11-23 22:49:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:19,990 INFO L93 Difference]: Finished difference Result 11255 states and 14463 transitions. [2019-11-23 22:49:19,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:19,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:49:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:20,023 INFO L225 Difference]: With dead ends: 11255 [2019-11-23 22:49:20,024 INFO L226 Difference]: Without dead ends: 5623 [2019-11-23 22:49:20,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5623 states. [2019-11-23 22:49:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5623 to 5623. [2019-11-23 22:49:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5623 states. [2019-11-23 22:49:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5623 states to 5623 states and 7226 transitions. [2019-11-23 22:49:20,313 INFO L78 Accepts]: Start accepts. Automaton has 5623 states and 7226 transitions. Word has length 100 [2019-11-23 22:49:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:20,314 INFO L462 AbstractCegarLoop]: Abstraction has 5623 states and 7226 transitions. [2019-11-23 22:49:20,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5623 states and 7226 transitions. [2019-11-23 22:49:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:49:20,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:20,317 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:20,318 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1717041067, now seen corresponding path program 1 times [2019-11-23 22:49:20,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:20,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680628573] [2019-11-23 22:49:20,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:20,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680628573] [2019-11-23 22:49:20,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:20,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:20,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524902461] [2019-11-23 22:49:20,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:20,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:20,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:20,360 INFO L87 Difference]: Start difference. First operand 5623 states and 7226 transitions. Second operand 3 states. [2019-11-23 22:49:20,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:20,866 INFO L93 Difference]: Finished difference Result 15853 states and 20316 transitions. [2019-11-23 22:49:20,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:20,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:49:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:20,920 INFO L225 Difference]: With dead ends: 15853 [2019-11-23 22:49:20,921 INFO L226 Difference]: Without dead ends: 10279 [2019-11-23 22:49:20,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2019-11-23 22:49:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 10181. [2019-11-23 22:49:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10181 states. [2019-11-23 22:49:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10181 states to 10181 states and 12994 transitions. [2019-11-23 22:49:21,380 INFO L78 Accepts]: Start accepts. Automaton has 10181 states and 12994 transitions. Word has length 101 [2019-11-23 22:49:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:21,381 INFO L462 AbstractCegarLoop]: Abstraction has 10181 states and 12994 transitions. [2019-11-23 22:49:21,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 10181 states and 12994 transitions. [2019-11-23 22:49:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:49:21,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:21,386 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:21,387 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 962085937, now seen corresponding path program 1 times [2019-11-23 22:49:21,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:21,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886647890] [2019-11-23 22:49:21,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:49:21,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886647890] [2019-11-23 22:49:21,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:21,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:21,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105255505] [2019-11-23 22:49:21,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:21,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:21,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:21,412 INFO L87 Difference]: Start difference. First operand 10181 states and 12994 transitions. Second operand 3 states. [2019-11-23 22:49:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:21,928 INFO L93 Difference]: Finished difference Result 20279 states and 25891 transitions. [2019-11-23 22:49:21,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:21,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:49:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:21,956 INFO L225 Difference]: With dead ends: 20279 [2019-11-23 22:49:21,956 INFO L226 Difference]: Without dead ends: 10139 [2019-11-23 22:49:21,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10139 states. [2019-11-23 22:49:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10139 to 10139. [2019-11-23 22:49:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10139 states. [2019-11-23 22:49:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10139 states to 10139 states and 12945 transitions. [2019-11-23 22:49:22,369 INFO L78 Accepts]: Start accepts. Automaton has 10139 states and 12945 transitions. Word has length 101 [2019-11-23 22:49:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:22,370 INFO L462 AbstractCegarLoop]: Abstraction has 10139 states and 12945 transitions. [2019-11-23 22:49:22,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10139 states and 12945 transitions. [2019-11-23 22:49:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:49:22,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:22,378 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:22,378 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash 580865280, now seen corresponding path program 1 times [2019-11-23 22:49:22,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:22,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865903323] [2019-11-23 22:49:22,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:22,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865903323] [2019-11-23 22:49:22,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:22,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:22,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490664145] [2019-11-23 22:49:22,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:22,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:22,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:22,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:22,436 INFO L87 Difference]: Start difference. First operand 10139 states and 12945 transitions. Second operand 3 states. [2019-11-23 22:49:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:23,178 INFO L93 Difference]: Finished difference Result 29130 states and 37125 transitions. [2019-11-23 22:49:23,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:23,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:49:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:23,216 INFO L225 Difference]: With dead ends: 29130 [2019-11-23 22:49:23,216 INFO L226 Difference]: Without dead ends: 19040 [2019-11-23 22:49:23,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19040 states. [2019-11-23 22:49:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19040 to 19040. [2019-11-23 22:49:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19040 states. [2019-11-23 22:49:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19040 states to 19040 states and 23980 transitions. [2019-11-23 22:49:24,512 INFO L78 Accepts]: Start accepts. Automaton has 19040 states and 23980 transitions. Word has length 102 [2019-11-23 22:49:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:24,512 INFO L462 AbstractCegarLoop]: Abstraction has 19040 states and 23980 transitions. [2019-11-23 22:49:24,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 19040 states and 23980 transitions. [2019-11-23 22:49:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 22:49:24,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:24,529 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:24,529 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:24,530 INFO L82 PathProgramCache]: Analyzing trace with hash 88412576, now seen corresponding path program 1 times [2019-11-23 22:49:24,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:24,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268155871] [2019-11-23 22:49:24,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:24,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268155871] [2019-11-23 22:49:24,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:24,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:24,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686886680] [2019-11-23 22:49:24,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:24,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:24,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:24,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:24,586 INFO L87 Difference]: Start difference. First operand 19040 states and 23980 transitions. Second operand 3 states. [2019-11-23 22:49:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:25,378 INFO L93 Difference]: Finished difference Result 46524 states and 58560 transitions. [2019-11-23 22:49:25,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:25,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 22:49:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:25,432 INFO L225 Difference]: With dead ends: 46524 [2019-11-23 22:49:25,432 INFO L226 Difference]: Without dead ends: 27552 [2019-11-23 22:49:25,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27552 states. [2019-11-23 22:49:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27552 to 27422. [2019-11-23 22:49:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27422 states. [2019-11-23 22:49:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27422 states to 27422 states and 34304 transitions. [2019-11-23 22:49:26,329 INFO L78 Accepts]: Start accepts. Automaton has 27422 states and 34304 transitions. Word has length 131 [2019-11-23 22:49:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:26,329 INFO L462 AbstractCegarLoop]: Abstraction has 27422 states and 34304 transitions. [2019-11-23 22:49:26,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 27422 states and 34304 transitions. [2019-11-23 22:49:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 22:49:26,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:26,350 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:49:26,350 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1706234777, now seen corresponding path program 1 times [2019-11-23 22:49:26,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:26,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513187146] [2019-11-23 22:49:26,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:26,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513187146] [2019-11-23 22:49:26,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:26,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:26,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75805861] [2019-11-23 22:49:26,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:26,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:26,415 INFO L87 Difference]: Start difference. First operand 27422 states and 34304 transitions. Second operand 3 states. [2019-11-23 22:49:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:27,713 INFO L93 Difference]: Finished difference Result 66974 states and 83694 transitions. [2019-11-23 22:49:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:27,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 22:49:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:27,773 INFO L225 Difference]: With dead ends: 66974 [2019-11-23 22:49:27,774 INFO L226 Difference]: Without dead ends: 39606 [2019-11-23 22:49:27,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39606 states. [2019-11-23 22:49:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39606 to 39412. [2019-11-23 22:49:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39412 states. [2019-11-23 22:49:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39412 states to 39412 states and 48936 transitions. [2019-11-23 22:49:29,056 INFO L78 Accepts]: Start accepts. Automaton has 39412 states and 48936 transitions. Word has length 131 [2019-11-23 22:49:29,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:29,056 INFO L462 AbstractCegarLoop]: Abstraction has 39412 states and 48936 transitions. [2019-11-23 22:49:29,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39412 states and 48936 transitions. [2019-11-23 22:49:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:49:29,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:29,080 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:29,080 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1755690609, now seen corresponding path program 1 times [2019-11-23 22:49:29,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:29,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13650271] [2019-11-23 22:49:29,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 22:49:29,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13650271] [2019-11-23 22:49:29,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:29,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:29,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360501471] [2019-11-23 22:49:29,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:29,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:29,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:29,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:29,131 INFO L87 Difference]: Start difference. First operand 39412 states and 48936 transitions. Second operand 3 states. [2019-11-23 22:49:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:31,009 INFO L93 Difference]: Finished difference Result 70452 states and 87649 transitions. [2019-11-23 22:49:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:31,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 22:49:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:31,055 INFO L225 Difference]: With dead ends: 70452 [2019-11-23 22:49:31,055 INFO L226 Difference]: Without dead ends: 40192 [2019-11-23 22:49:31,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40192 states. [2019-11-23 22:49:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40192 to 38692. [2019-11-23 22:49:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38692 states. [2019-11-23 22:49:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38692 states to 38692 states and 47328 transitions. [2019-11-23 22:49:32,159 INFO L78 Accepts]: Start accepts. Automaton has 38692 states and 47328 transitions. Word has length 147 [2019-11-23 22:49:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:32,159 INFO L462 AbstractCegarLoop]: Abstraction has 38692 states and 47328 transitions. [2019-11-23 22:49:32,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 38692 states and 47328 transitions. [2019-11-23 22:49:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:32,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:32,180 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 22:49:32,180 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash -843985056, now seen corresponding path program 1 times [2019-11-23 22:49:32,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:32,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217567047] [2019-11-23 22:49:32,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:32,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217567047] [2019-11-23 22:49:32,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:32,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:32,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125422060] [2019-11-23 22:49:32,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:32,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:32,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:32,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:32,235 INFO L87 Difference]: Start difference. First operand 38692 states and 47328 transitions. Second operand 3 states. [2019-11-23 22:49:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:33,129 INFO L93 Difference]: Finished difference Result 65496 states and 80354 transitions. [2019-11-23 22:49:33,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:33,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:49:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:33,167 INFO L225 Difference]: With dead ends: 65496 [2019-11-23 22:49:33,167 INFO L226 Difference]: Without dead ends: 38694 [2019-11-23 22:49:33,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38694 states. [2019-11-23 22:49:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38694 to 38692. [2019-11-23 22:49:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38692 states. [2019-11-23 22:49:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38692 states to 38692 states and 47208 transitions. [2019-11-23 22:49:34,319 INFO L78 Accepts]: Start accepts. Automaton has 38692 states and 47208 transitions. Word has length 148 [2019-11-23 22:49:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:34,320 INFO L462 AbstractCegarLoop]: Abstraction has 38692 states and 47208 transitions. [2019-11-23 22:49:34,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 38692 states and 47208 transitions. [2019-11-23 22:49:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:34,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:34,337 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 22:49:34,337 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash 489651490, now seen corresponding path program 1 times [2019-11-23 22:49:34,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:34,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901298497] [2019-11-23 22:49:34,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:34,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901298497] [2019-11-23 22:49:34,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:34,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:34,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620004418] [2019-11-23 22:49:34,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:34,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:34,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:34,383 INFO L87 Difference]: Start difference. First operand 38692 states and 47208 transitions. Second operand 3 states. [2019-11-23 22:49:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:35,393 INFO L93 Difference]: Finished difference Result 65520 states and 80194 transitions. [2019-11-23 22:49:35,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:35,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:49:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:35,431 INFO L225 Difference]: With dead ends: 65520 [2019-11-23 22:49:35,431 INFO L226 Difference]: Without dead ends: 38694 [2019-11-23 22:49:35,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38694 states. [2019-11-23 22:49:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38694 to 38692. [2019-11-23 22:49:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38692 states. [2019-11-23 22:49:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38692 states to 38692 states and 47040 transitions. [2019-11-23 22:49:36,318 INFO L78 Accepts]: Start accepts. Automaton has 38692 states and 47040 transitions. Word has length 148 [2019-11-23 22:49:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:36,318 INFO L462 AbstractCegarLoop]: Abstraction has 38692 states and 47040 transitions. [2019-11-23 22:49:36,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 38692 states and 47040 transitions. [2019-11-23 22:49:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:36,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:36,331 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 22:49:36,331 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 219973282, now seen corresponding path program 1 times [2019-11-23 22:49:36,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:36,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178897520] [2019-11-23 22:49:36,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:49:36,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178897520] [2019-11-23 22:49:36,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:36,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:36,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166766359] [2019-11-23 22:49:36,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:36,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:36,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:36,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:36,395 INFO L87 Difference]: Start difference. First operand 38692 states and 47040 transitions. Second operand 3 states. [2019-11-23 22:49:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:38,064 INFO L93 Difference]: Finished difference Result 77296 states and 93982 transitions. [2019-11-23 22:49:38,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:38,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:49:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:38,114 INFO L225 Difference]: With dead ends: 77296 [2019-11-23 22:49:38,114 INFO L226 Difference]: Without dead ends: 38694 [2019-11-23 22:49:38,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38694 states. [2019-11-23 22:49:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38694 to 38692. [2019-11-23 22:49:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38692 states. [2019-11-23 22:49:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38692 states to 38692 states and 46680 transitions. [2019-11-23 22:49:39,163 INFO L78 Accepts]: Start accepts. Automaton has 38692 states and 46680 transitions. Word has length 148 [2019-11-23 22:49:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:39,164 INFO L462 AbstractCegarLoop]: Abstraction has 38692 states and 46680 transitions. [2019-11-23 22:49:39,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 38692 states and 46680 transitions. [2019-11-23 22:49:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:39,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:39,175 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:49:39,175 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:39,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1496214656, now seen corresponding path program 1 times [2019-11-23 22:49:39,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:39,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099450735] [2019-11-23 22:49:39,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:39,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099450735] [2019-11-23 22:49:39,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:39,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:39,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530666282] [2019-11-23 22:49:39,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:39,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:39,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:39,238 INFO L87 Difference]: Start difference. First operand 38692 states and 46680 transitions. Second operand 5 states. [2019-11-23 22:49:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:40,690 INFO L93 Difference]: Finished difference Result 75818 states and 91435 transitions. [2019-11-23 22:49:40,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:40,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-11-23 22:49:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:40,725 INFO L225 Difference]: With dead ends: 75818 [2019-11-23 22:49:40,726 INFO L226 Difference]: Without dead ends: 37176 [2019-11-23 22:49:40,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37176 states. [2019-11-23 22:49:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37176 to 33546. [2019-11-23 22:49:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33546 states. [2019-11-23 22:49:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33546 states to 33546 states and 39768 transitions. [2019-11-23 22:49:41,964 INFO L78 Accepts]: Start accepts. Automaton has 33546 states and 39768 transitions. Word has length 148 [2019-11-23 22:49:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:41,965 INFO L462 AbstractCegarLoop]: Abstraction has 33546 states and 39768 transitions. [2019-11-23 22:49:41,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33546 states and 39768 transitions. [2019-11-23 22:49:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:41,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:41,976 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:49:41,976 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash 897907326, now seen corresponding path program 1 times [2019-11-23 22:49:41,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:41,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609674524] [2019-11-23 22:49:41,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:42,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609674524] [2019-11-23 22:49:42,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:42,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:42,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854371800] [2019-11-23 22:49:42,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:42,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:42,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:42,032 INFO L87 Difference]: Start difference. First operand 33546 states and 39768 transitions. Second operand 3 states. [2019-11-23 22:49:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:43,332 INFO L93 Difference]: Finished difference Result 56950 states and 67662 transitions. [2019-11-23 22:49:43,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:43,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:49:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:43,369 INFO L225 Difference]: With dead ends: 56950 [2019-11-23 22:49:43,370 INFO L226 Difference]: Without dead ends: 33716 [2019-11-23 22:49:43,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33716 states. [2019-11-23 22:49:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33716 to 33546. [2019-11-23 22:49:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33546 states. [2019-11-23 22:49:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33546 states to 33546 states and 39136 transitions. [2019-11-23 22:49:45,143 INFO L78 Accepts]: Start accepts. Automaton has 33546 states and 39136 transitions. Word has length 148 [2019-11-23 22:49:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:45,144 INFO L462 AbstractCegarLoop]: Abstraction has 33546 states and 39136 transitions. [2019-11-23 22:49:45,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 33546 states and 39136 transitions. [2019-11-23 22:49:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:45,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:45,154 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:49:45,154 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1991867506, now seen corresponding path program 1 times [2019-11-23 22:49:45,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:45,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253576660] [2019-11-23 22:49:45,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:45,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253576660] [2019-11-23 22:49:45,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:45,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:45,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264576624] [2019-11-23 22:49:45,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:45,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:45,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:45,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:45,198 INFO L87 Difference]: Start difference. First operand 33546 states and 39136 transitions. Second operand 3 states. [2019-11-23 22:49:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:46,103 INFO L93 Difference]: Finished difference Result 56974 states and 66606 transitions. [2019-11-23 22:49:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:46,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:49:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:46,135 INFO L225 Difference]: With dead ends: 56974 [2019-11-23 22:49:46,135 INFO L226 Difference]: Without dead ends: 33716 [2019-11-23 22:49:46,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33716 states. [2019-11-23 22:49:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33716 to 33546. [2019-11-23 22:49:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33546 states. [2019-11-23 22:49:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33546 states to 33546 states and 38504 transitions. [2019-11-23 22:49:47,266 INFO L78 Accepts]: Start accepts. Automaton has 33546 states and 38504 transitions. Word has length 148 [2019-11-23 22:49:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:47,266 INFO L462 AbstractCegarLoop]: Abstraction has 33546 states and 38504 transitions. [2019-11-23 22:49:47,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 33546 states and 38504 transitions. [2019-11-23 22:49:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:47,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:47,274 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:49:47,274 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash -260035431, now seen corresponding path program 1 times [2019-11-23 22:49:47,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:47,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013761554] [2019-11-23 22:49:47,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:47,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013761554] [2019-11-23 22:49:47,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:47,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:47,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23520287] [2019-11-23 22:49:47,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:47,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:47,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:47,326 INFO L87 Difference]: Start difference. First operand 33546 states and 38504 transitions. Second operand 5 states. [2019-11-23 22:49:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:48,345 INFO L93 Difference]: Finished difference Result 64812 states and 74527 transitions. [2019-11-23 22:49:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:48,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-11-23 22:49:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:48,374 INFO L225 Difference]: With dead ends: 64812 [2019-11-23 22:49:48,375 INFO L226 Difference]: Without dead ends: 31328 [2019-11-23 22:49:48,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31328 states. [2019-11-23 22:49:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31328 to 28718. [2019-11-23 22:49:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28718 states. [2019-11-23 22:49:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28718 states to 28718 states and 32518 transitions. [2019-11-23 22:49:49,500 INFO L78 Accepts]: Start accepts. Automaton has 28718 states and 32518 transitions. Word has length 148 [2019-11-23 22:49:49,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:49,500 INFO L462 AbstractCegarLoop]: Abstraction has 28718 states and 32518 transitions. [2019-11-23 22:49:49,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 28718 states and 32518 transitions. [2019-11-23 22:49:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:49,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:49,506 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:49:49,506 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:49,506 INFO L82 PathProgramCache]: Analyzing trace with hash 856146455, now seen corresponding path program 1 times [2019-11-23 22:49:49,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:49,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306495251] [2019-11-23 22:49:49,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:49,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306495251] [2019-11-23 22:49:49,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:49,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:49,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513393796] [2019-11-23 22:49:49,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:49,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:49,552 INFO L87 Difference]: Start difference. First operand 28718 states and 32518 transitions. Second operand 5 states. [2019-11-23 22:49:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:50,538 INFO L93 Difference]: Finished difference Result 55160 states and 62601 transitions. [2019-11-23 22:49:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:50,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-11-23 22:49:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:50,563 INFO L225 Difference]: With dead ends: 55160 [2019-11-23 22:49:50,563 INFO L226 Difference]: Without dead ends: 26516 [2019-11-23 22:49:50,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26516 states. [2019-11-23 22:49:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26516 to 23332. [2019-11-23 22:49:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23332 states. [2019-11-23 22:49:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23332 states to 23332 states and 26046 transitions. [2019-11-23 22:49:51,544 INFO L78 Accepts]: Start accepts. Automaton has 23332 states and 26046 transitions. Word has length 148 [2019-11-23 22:49:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:51,544 INFO L462 AbstractCegarLoop]: Abstraction has 23332 states and 26046 transitions. [2019-11-23 22:49:51,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 23332 states and 26046 transitions. [2019-11-23 22:49:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:49:51,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:51,548 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:49:51,548 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2108371435, now seen corresponding path program 1 times [2019-11-23 22:49:51,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:51,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756340068] [2019-11-23 22:49:51,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:51,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756340068] [2019-11-23 22:49:51,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:51,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:51,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370343762] [2019-11-23 22:49:51,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:51,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:51,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:51,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:51,586 INFO L87 Difference]: Start difference. First operand 23332 states and 26046 transitions. Second operand 3 states. [2019-11-23 22:49:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:52,439 INFO L93 Difference]: Finished difference Result 42462 states and 47519 transitions. [2019-11-23 22:49:52,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:52,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:49:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:52,462 INFO L225 Difference]: With dead ends: 42462 [2019-11-23 22:49:52,462 INFO L226 Difference]: Without dead ends: 23932 [2019-11-23 22:49:52,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23932 states. [2019-11-23 22:49:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23932 to 23212. [2019-11-23 22:49:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23212 states. [2019-11-23 22:49:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23212 states to 23212 states and 25430 transitions. [2019-11-23 22:49:53,460 INFO L78 Accepts]: Start accepts. Automaton has 23212 states and 25430 transitions. Word has length 148 [2019-11-23 22:49:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:53,461 INFO L462 AbstractCegarLoop]: Abstraction has 23212 states and 25430 transitions. [2019-11-23 22:49:53,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 23212 states and 25430 transitions. [2019-11-23 22:49:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:49:53,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:53,464 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:49:53,464 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1010592576, now seen corresponding path program 1 times [2019-11-23 22:49:53,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:53,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890074999] [2019-11-23 22:49:53,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 22:49:53,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890074999] [2019-11-23 22:49:53,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:53,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:53,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363061740] [2019-11-23 22:49:53,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:53,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:53,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:53,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:53,510 INFO L87 Difference]: Start difference. First operand 23212 states and 25430 transitions. Second operand 5 states. [2019-11-23 22:49:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:54,030 INFO L93 Difference]: Finished difference Result 32260 states and 35246 transitions. [2019-11-23 22:49:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:54,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-11-23 22:49:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:54,035 INFO L225 Difference]: With dead ends: 32260 [2019-11-23 22:49:54,036 INFO L226 Difference]: Without dead ends: 4687 [2019-11-23 22:49:54,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2019-11-23 22:49:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4578. [2019-11-23 22:49:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4578 states. [2019-11-23 22:49:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4578 states to 4578 states and 4847 transitions. [2019-11-23 22:49:54,208 INFO L78 Accepts]: Start accepts. Automaton has 4578 states and 4847 transitions. Word has length 149 [2019-11-23 22:49:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:54,209 INFO L462 AbstractCegarLoop]: Abstraction has 4578 states and 4847 transitions. [2019-11-23 22:49:54,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4578 states and 4847 transitions. [2019-11-23 22:49:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-23 22:49:54,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:54,211 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:49:54,211 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1958687413, now seen corresponding path program 1 times [2019-11-23 22:49:54,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:54,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478492495] [2019-11-23 22:49:54,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:49:54,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478492495] [2019-11-23 22:49:54,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:54,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:54,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690967539] [2019-11-23 22:49:54,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:54,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:54,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:54,273 INFO L87 Difference]: Start difference. First operand 4578 states and 4847 transitions. Second operand 3 states. [2019-11-23 22:49:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:54,429 INFO L93 Difference]: Finished difference Result 5862 states and 6205 transitions. [2019-11-23 22:49:54,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:54,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-23 22:49:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:54,433 INFO L225 Difference]: With dead ends: 5862 [2019-11-23 22:49:54,433 INFO L226 Difference]: Without dead ends: 3668 [2019-11-23 22:49:54,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2019-11-23 22:49:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3668. [2019-11-23 22:49:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3668 states. [2019-11-23 22:49:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 3873 transitions. [2019-11-23 22:49:54,561 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 3873 transitions. Word has length 220 [2019-11-23 22:49:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:54,561 INFO L462 AbstractCegarLoop]: Abstraction has 3668 states and 3873 transitions. [2019-11-23 22:49:54,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 3873 transitions. [2019-11-23 22:49:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-23 22:49:54,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:54,563 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:49:54,563 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:54,564 INFO L82 PathProgramCache]: Analyzing trace with hash 356473640, now seen corresponding path program 1 times [2019-11-23 22:49:54,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:54,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336838808] [2019-11-23 22:49:54,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:49:54,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336838808] [2019-11-23 22:49:54,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:54,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:49:54,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834955276] [2019-11-23 22:49:54,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:49:54,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:54,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:49:54,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:49:54,771 INFO L87 Difference]: Start difference. First operand 3668 states and 3873 transitions. Second operand 6 states. [2019-11-23 22:49:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:54,981 INFO L93 Difference]: Finished difference Result 3668 states and 3873 transitions. [2019-11-23 22:49:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:54,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2019-11-23 22:49:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:54,982 INFO L225 Difference]: With dead ends: 3668 [2019-11-23 22:49:54,982 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:49:54,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:49:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:49:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:49:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:49:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:49:54,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2019-11-23 22:49:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:54,985 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:49:54,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:49:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:49:54,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:49:54,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:49:55,941 WARN L192 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:49:56,075 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-11-23 22:49:56,406 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2019-11-23 22:49:56,753 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:49:57,032 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 119 [2019-11-23 22:49:57,507 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:49:57,837 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:49:58,270 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:49:58,496 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:49:58,638 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:49:58,962 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:49:59,198 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 370 DAG size of output: 236 [2019-11-23 22:49:59,414 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 182 [2019-11-23 22:49:59,690 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:49:59,962 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:50:00,294 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:50:00,443 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:50:00,702 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:50:00,864 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:50:01,138 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 356 DAG size of output: 208 [2019-11-23 22:50:01,277 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:50:01,576 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 173 [2019-11-23 22:50:02,063 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 120 [2019-11-23 22:50:02,366 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 481 DAG size of output: 219 [2019-11-23 22:50:02,625 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 189 [2019-11-23 22:50:02,791 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 121 [2019-11-23 22:50:02,930 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:50:03,342 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 524 DAG size of output: 314 [2019-11-23 22:50:03,636 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 175 [2019-11-23 22:50:03,808 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 196 [2019-11-23 22:50:03,944 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 117 [2019-11-23 22:50:04,308 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 122 [2019-11-23 22:50:04,516 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 206 [2019-11-23 22:50:04,804 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 123 [2019-11-23 22:50:05,024 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 368 DAG size of output: 236 [2019-11-23 22:50:05,212 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:50:05,363 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 121 [2019-11-23 22:50:05,701 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 198 [2019-11-23 22:50:11,477 WARN L192 SmtUtils]: Spent 5.77 s on a formula simplification. DAG size of input: 164 DAG size of output: 125 [2019-11-23 22:50:12,328 WARN L192 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-11-23 22:50:15,141 WARN L192 SmtUtils]: Spent 2.81 s on a formula simplification that was a NOOP. DAG size: 119 [2019-11-23 22:50:18,087 WARN L192 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 121 [2019-11-23 22:50:20,892 WARN L192 SmtUtils]: Spent 2.80 s on a formula simplification that was a NOOP. DAG size: 119 [2019-11-23 22:50:26,578 WARN L192 SmtUtils]: Spent 5.68 s on a formula simplification. DAG size of input: 164 DAG size of output: 125 [2019-11-23 22:50:26,728 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-23 22:50:27,194 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-11-23 22:50:27,659 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-11-23 22:50:30,615 WARN L192 SmtUtils]: Spent 2.95 s on a formula simplification that was a NOOP. DAG size: 121 [2019-11-23 22:50:36,287 WARN L192 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 164 DAG size of output: 125 [2019-11-23 22:50:37,068 WARN L192 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77