/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:55:14,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:55:14,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:55:14,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:55:14,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:55:14,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:55:14,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:55:14,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:55:14,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:55:14,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:55:14,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:55:14,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:55:14,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:55:14,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:55:14,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:55:14,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:55:14,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:55:14,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:55:14,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:55:14,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:55:14,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:55:14,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:55:14,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:55:14,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:55:14,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:55:14,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:55:14,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:55:14,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:55:14,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:55:14,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:55:14,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:55:14,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:55:14,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:55:14,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:55:14,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:55:14,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:55:14,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:55:14,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:55:14,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:55:14,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:55:14,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:55:14,475 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 20:55:14,489 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:55:14,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:55:14,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:55:14,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:55:14,491 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:55:14,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:55:14,491 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:55:14,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:55:14,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:55:14,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:55:14,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:55:14,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:55:14,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:55:14,493 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:55:14,493 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:55:14,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:55:14,493 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:55:14,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:55:14,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:55:14,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:55:14,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:55:14,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:55:14,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:55:14,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:55:14,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:55:14,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:55:14,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:55:14,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:55:14,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:55:14,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:55:14,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:55:14,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:55:14,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:55:14,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:55:14,805 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:55:14,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08.c [2019-11-23 20:55:14,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c544e33/665da19671644ea7827bfb958e3b2a02/FLAG5e4ebacfd [2019-11-23 20:55:15,552 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:55:15,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label08.c [2019-11-23 20:55:15,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c544e33/665da19671644ea7827bfb958e3b2a02/FLAG5e4ebacfd [2019-11-23 20:55:15,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c544e33/665da19671644ea7827bfb958e3b2a02 [2019-11-23 20:55:15,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:55:15,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:55:15,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:15,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:55:15,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:55:15,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:15" (1/1) ... [2019-11-23 20:55:15,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682dd186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:15, skipping insertion in model container [2019-11-23 20:55:15,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:15" (1/1) ... [2019-11-23 20:55:15,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:55:15,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:55:16,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:16,675 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:55:17,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:17,073 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:55:17,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17 WrapperNode [2019-11-23 20:55:17,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:17,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:17,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:55:17,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:55:17,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:17,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:55:17,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:55:17,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:55:17,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:55:17,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:55:17,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:55:17,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:55:17,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (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 20:55:17,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:55:17,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:55:19,460 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:55:19,460 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:55:19,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:19 BoogieIcfgContainer [2019-11-23 20:55:19,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:55:19,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:55:19,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:55:19,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:55:19,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:55:15" (1/3) ... [2019-11-23 20:55:19,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb2613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:19, skipping insertion in model container [2019-11-23 20:55:19,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (2/3) ... [2019-11-23 20:55:19,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb2613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:19, skipping insertion in model container [2019-11-23 20:55:19,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:19" (3/3) ... [2019-11-23 20:55:19,471 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label08.c [2019-11-23 20:55:19,485 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:55:19,497 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:55:19,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:55:19,552 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:55:19,552 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:55:19,552 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:55:19,552 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:55:19,552 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:55:19,553 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:55:19,553 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:55:19,553 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:55:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:55:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 20:55:19,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:19,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:19,615 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:19,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash -576261461, now seen corresponding path program 1 times [2019-11-23 20:55:19,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:19,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059896998] [2019-11-23 20:55:19,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:20,322 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 20:55:20,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059896998] [2019-11-23 20:55:20,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:20,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:20,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633854227] [2019-11-23 20:55:20,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:20,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:20,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:20,351 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:55:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:22,681 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-11-23 20:55:22,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:22,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 20:55:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:22,705 INFO L225 Difference]: With dead ends: 1023 [2019-11-23 20:55:22,705 INFO L226 Difference]: Without dead ends: 654 [2019-11-23 20:55:22,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-11-23 20:55:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-11-23 20:55:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-11-23 20:55:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-11-23 20:55:22,792 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 157 [2019-11-23 20:55:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:22,793 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-11-23 20:55:22,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-11-23 20:55:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 20:55:22,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:22,799 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:55:22,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:22,800 INFO L82 PathProgramCache]: Analyzing trace with hash 933680492, now seen corresponding path program 1 times [2019-11-23 20:55:22,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:22,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380811148] [2019-11-23 20:55:22,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:22,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380811148] [2019-11-23 20:55:22,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:22,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:22,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339859356] [2019-11-23 20:55:22,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:22,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:22,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:22,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:22,892 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-11-23 20:55:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:24,006 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-11-23 20:55:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:24,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-23 20:55:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:24,016 INFO L225 Difference]: With dead ends: 1929 [2019-11-23 20:55:24,016 INFO L226 Difference]: Without dead ends: 1279 [2019-11-23 20:55:24,020 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 20:55:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-11-23 20:55:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-11-23 20:55:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-23 20:55:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1832 transitions. [2019-11-23 20:55:24,067 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1832 transitions. Word has length 165 [2019-11-23 20:55:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:24,067 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1832 transitions. [2019-11-23 20:55:24,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1832 transitions. [2019-11-23 20:55:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 20:55:24,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:24,075 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 20:55:24,075 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1802100129, now seen corresponding path program 1 times [2019-11-23 20:55:24,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:24,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213952587] [2019-11-23 20:55:24,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:24,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213952587] [2019-11-23 20:55:24,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:24,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:24,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90055315] [2019-11-23 20:55:24,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:24,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:24,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:24,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:24,325 INFO L87 Difference]: Start difference. First operand 1265 states and 1832 transitions. Second operand 3 states. [2019-11-23 20:55:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:25,481 INFO L93 Difference]: Finished difference Result 3763 states and 5463 transitions. [2019-11-23 20:55:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:25,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 20:55:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:25,496 INFO L225 Difference]: With dead ends: 3763 [2019-11-23 20:55:25,497 INFO L226 Difference]: Without dead ends: 2500 [2019-11-23 20:55:25,500 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 20:55:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2019-11-23 20:55:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2486. [2019-11-23 20:55:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-11-23 20:55:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3511 transitions. [2019-11-23 20:55:25,571 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3511 transitions. Word has length 172 [2019-11-23 20:55:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:25,574 INFO L462 AbstractCegarLoop]: Abstraction has 2486 states and 3511 transitions. [2019-11-23 20:55:25,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3511 transitions. [2019-11-23 20:55:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 20:55:25,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:25,590 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:25,590 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1011238727, now seen corresponding path program 1 times [2019-11-23 20:55:25,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:25,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762739751] [2019-11-23 20:55:25,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:55:25,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762739751] [2019-11-23 20:55:25,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:25,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:25,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115485358] [2019-11-23 20:55:25,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:25,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:25,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:25,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:25,690 INFO L87 Difference]: Start difference. First operand 2486 states and 3511 transitions. Second operand 3 states. [2019-11-23 20:55:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:26,279 INFO L93 Difference]: Finished difference Result 4947 states and 6989 transitions. [2019-11-23 20:55:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:26,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-23 20:55:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:26,291 INFO L225 Difference]: With dead ends: 4947 [2019-11-23 20:55:26,291 INFO L226 Difference]: Without dead ends: 2463 [2019-11-23 20:55:26,295 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 20:55:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2019-11-23 20:55:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2463. [2019-11-23 20:55:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-11-23 20:55:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3404 transitions. [2019-11-23 20:55:26,344 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3404 transitions. Word has length 185 [2019-11-23 20:55:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:26,344 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 3404 transitions. [2019-11-23 20:55:26,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3404 transitions. [2019-11-23 20:55:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-23 20:55:26,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:26,351 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:26,351 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash -794235702, now seen corresponding path program 1 times [2019-11-23 20:55:26,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:26,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870057946] [2019-11-23 20:55:26,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:26,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870057946] [2019-11-23 20:55:26,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:26,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:26,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734601899] [2019-11-23 20:55:26,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:26,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:26,451 INFO L87 Difference]: Start difference. First operand 2463 states and 3404 transitions. Second operand 3 states. [2019-11-23 20:55:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:27,501 INFO L93 Difference]: Finished difference Result 6960 states and 9633 transitions. [2019-11-23 20:55:27,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:27,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-23 20:55:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:27,522 INFO L225 Difference]: With dead ends: 6960 [2019-11-23 20:55:27,522 INFO L226 Difference]: Without dead ends: 4499 [2019-11-23 20:55:27,526 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 20:55:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-11-23 20:55:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 4496. [2019-11-23 20:55:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4496 states. [2019-11-23 20:55:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 5968 transitions. [2019-11-23 20:55:27,617 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 5968 transitions. Word has length 206 [2019-11-23 20:55:27,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:27,617 INFO L462 AbstractCegarLoop]: Abstraction has 4496 states and 5968 transitions. [2019-11-23 20:55:27,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 5968 transitions. [2019-11-23 20:55:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-23 20:55:27,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:27,627 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:27,627 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:27,628 INFO L82 PathProgramCache]: Analyzing trace with hash -670047859, now seen corresponding path program 1 times [2019-11-23 20:55:27,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:27,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80984835] [2019-11-23 20:55:27,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:27,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80984835] [2019-11-23 20:55:27,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:27,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:27,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882659597] [2019-11-23 20:55:27,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:27,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:27,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:27,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:27,772 INFO L87 Difference]: Start difference. First operand 4496 states and 5968 transitions. Second operand 4 states. [2019-11-23 20:55:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:29,449 INFO L93 Difference]: Finished difference Result 15700 states and 20741 transitions. [2019-11-23 20:55:29,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:29,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-23 20:55:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:29,506 INFO L225 Difference]: With dead ends: 15700 [2019-11-23 20:55:29,506 INFO L226 Difference]: Without dead ends: 11206 [2019-11-23 20:55:29,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11206 states. [2019-11-23 20:55:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11206 to 8354. [2019-11-23 20:55:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8354 states. [2019-11-23 20:55:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8354 states to 8354 states and 10662 transitions. [2019-11-23 20:55:29,717 INFO L78 Accepts]: Start accepts. Automaton has 8354 states and 10662 transitions. Word has length 211 [2019-11-23 20:55:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:29,717 INFO L462 AbstractCegarLoop]: Abstraction has 8354 states and 10662 transitions. [2019-11-23 20:55:29,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 8354 states and 10662 transitions. [2019-11-23 20:55:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-23 20:55:29,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:29,737 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:55:29,738 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:29,738 INFO L82 PathProgramCache]: Analyzing trace with hash 314070830, now seen corresponding path program 1 times [2019-11-23 20:55:29,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:29,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736875236] [2019-11-23 20:55:29,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 20:55:29,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736875236] [2019-11-23 20:55:29,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:29,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:29,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187665507] [2019-11-23 20:55:29,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:29,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:29,894 INFO L87 Difference]: Start difference. First operand 8354 states and 10662 transitions. Second operand 3 states. [2019-11-23 20:55:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:31,035 INFO L93 Difference]: Finished difference Result 20785 states and 26523 transitions. [2019-11-23 20:55:31,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:31,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-11-23 20:55:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:31,068 INFO L225 Difference]: With dead ends: 20785 [2019-11-23 20:55:31,069 INFO L226 Difference]: Without dead ends: 12433 [2019-11-23 20:55:31,078 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 20:55:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12433 states. [2019-11-23 20:55:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12433 to 12430. [2019-11-23 20:55:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12430 states. [2019-11-23 20:55:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12430 states to 12430 states and 15815 transitions. [2019-11-23 20:55:31,262 INFO L78 Accepts]: Start accepts. Automaton has 12430 states and 15815 transitions. Word has length 219 [2019-11-23 20:55:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:31,263 INFO L462 AbstractCegarLoop]: Abstraction has 12430 states and 15815 transitions. [2019-11-23 20:55:31,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 12430 states and 15815 transitions. [2019-11-23 20:55:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-23 20:55:31,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:31,284 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:55:31,285 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash 660276643, now seen corresponding path program 1 times [2019-11-23 20:55:31,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:31,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561589898] [2019-11-23 20:55:31,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 20:55:31,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561589898] [2019-11-23 20:55:31,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555672967] [2019-11-23 20:55:31,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:31,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:55:31,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 20:55:31,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:31,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-23 20:55:31,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246810757] [2019-11-23 20:55:31,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:31,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:31,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:31,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:31,801 INFO L87 Difference]: Start difference. First operand 12430 states and 15815 transitions. Second operand 3 states. [2019-11-23 20:55:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:32,876 INFO L93 Difference]: Finished difference Result 34823 states and 44450 transitions. [2019-11-23 20:55:32,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:32,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-23 20:55:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:32,916 INFO L225 Difference]: With dead ends: 34823 [2019-11-23 20:55:32,917 INFO L226 Difference]: Without dead ends: 22395 [2019-11-23 20:55:32,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22395 states. [2019-11-23 20:55:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22395 to 20769. [2019-11-23 20:55:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20769 states. [2019-11-23 20:55:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20769 states to 20769 states and 25871 transitions. [2019-11-23 20:55:33,513 INFO L78 Accepts]: Start accepts. Automaton has 20769 states and 25871 transitions. Word has length 226 [2019-11-23 20:55:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:33,513 INFO L462 AbstractCegarLoop]: Abstraction has 20769 states and 25871 transitions. [2019-11-23 20:55:33,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 20769 states and 25871 transitions. [2019-11-23 20:55:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-23 20:55:33,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:33,547 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:33,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:33,759 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:33,760 INFO L82 PathProgramCache]: Analyzing trace with hash 222902275, now seen corresponding path program 1 times [2019-11-23 20:55:33,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:33,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473223061] [2019-11-23 20:55:33,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:33,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473223061] [2019-11-23 20:55:33,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:33,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:55:33,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615986431] [2019-11-23 20:55:33,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:55:33,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:33,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:55:33,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:33,989 INFO L87 Difference]: Start difference. First operand 20769 states and 25871 transitions. Second operand 5 states. [2019-11-23 20:55:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:36,698 INFO L93 Difference]: Finished difference Result 62076 states and 77235 transitions. [2019-11-23 20:55:36,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:55:36,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 226 [2019-11-23 20:55:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:36,762 INFO L225 Difference]: With dead ends: 62076 [2019-11-23 20:55:36,763 INFO L226 Difference]: Without dead ends: 41309 [2019-11-23 20:55:36,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41309 states. [2019-11-23 20:55:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41309 to 41301. [2019-11-23 20:55:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41301 states. [2019-11-23 20:55:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41301 states to 41301 states and 49699 transitions. [2019-11-23 20:55:37,416 INFO L78 Accepts]: Start accepts. Automaton has 41301 states and 49699 transitions. Word has length 226 [2019-11-23 20:55:37,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:37,417 INFO L462 AbstractCegarLoop]: Abstraction has 41301 states and 49699 transitions. [2019-11-23 20:55:37,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:55:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 41301 states and 49699 transitions. [2019-11-23 20:55:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-23 20:55:37,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:37,479 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:37,479 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash -473613121, now seen corresponding path program 1 times [2019-11-23 20:55:37,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:37,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621291109] [2019-11-23 20:55:37,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:37,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621291109] [2019-11-23 20:55:37,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:37,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:37,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400805436] [2019-11-23 20:55:37,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:37,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:37,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:37,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:37,867 INFO L87 Difference]: Start difference. First operand 41301 states and 49699 transitions. Second operand 3 states. [2019-11-23 20:55:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:39,036 INFO L93 Difference]: Finished difference Result 105212 states and 126813 transitions. [2019-11-23 20:55:39,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:39,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-23 20:55:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:39,111 INFO L225 Difference]: With dead ends: 105212 [2019-11-23 20:55:39,111 INFO L226 Difference]: Without dead ends: 63913 [2019-11-23 20:55:39,145 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 20:55:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63913 states. [2019-11-23 20:55:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63913 to 63909. [2019-11-23 20:55:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63909 states. [2019-11-23 20:55:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63909 states to 63909 states and 76912 transitions. [2019-11-23 20:55:40,047 INFO L78 Accepts]: Start accepts. Automaton has 63909 states and 76912 transitions. Word has length 272 [2019-11-23 20:55:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:40,048 INFO L462 AbstractCegarLoop]: Abstraction has 63909 states and 76912 transitions. [2019-11-23 20:55:40,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 63909 states and 76912 transitions. [2019-11-23 20:55:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-23 20:55:40,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:40,078 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:40,079 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:40,079 INFO L82 PathProgramCache]: Analyzing trace with hash 251932010, now seen corresponding path program 1 times [2019-11-23 20:55:40,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:40,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462848519] [2019-11-23 20:55:40,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:42,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462848519] [2019-11-23 20:55:42,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:42,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 20:55:42,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345626895] [2019-11-23 20:55:42,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 20:55:42,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 20:55:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-23 20:55:42,223 INFO L87 Difference]: Start difference. First operand 63909 states and 76912 transitions. Second operand 11 states. [2019-11-23 20:55:42,517 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-23 20:55:46,106 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-23 20:55:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:46,362 INFO L93 Difference]: Finished difference Result 174840 states and 208641 transitions. [2019-11-23 20:55:46,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:55:46,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 279 [2019-11-23 20:55:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:46,473 INFO L225 Difference]: With dead ends: 174840 [2019-11-23 20:55:46,473 INFO L226 Difference]: Without dead ends: 110933 [2019-11-23 20:55:46,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:55:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110933 states. [2019-11-23 20:55:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110933 to 108646. [2019-11-23 20:55:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108646 states. [2019-11-23 20:55:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108646 states to 108646 states and 129141 transitions. [2019-11-23 20:55:50,029 INFO L78 Accepts]: Start accepts. Automaton has 108646 states and 129141 transitions. Word has length 279 [2019-11-23 20:55:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:50,030 INFO L462 AbstractCegarLoop]: Abstraction has 108646 states and 129141 transitions. [2019-11-23 20:55:50,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 20:55:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 108646 states and 129141 transitions. [2019-11-23 20:55:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-23 20:55:50,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:50,095 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:50,095 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:50,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1251867700, now seen corresponding path program 1 times [2019-11-23 20:55:50,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:50,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234188375] [2019-11-23 20:55:50,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:55:50,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234188375] [2019-11-23 20:55:50,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:50,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:55:50,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331931969] [2019-11-23 20:55:50,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:55:50,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:50,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:55:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:50,322 INFO L87 Difference]: Start difference. First operand 108646 states and 129141 transitions. Second operand 5 states. [2019-11-23 20:55:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:53,251 INFO L93 Difference]: Finished difference Result 333508 states and 394881 transitions. [2019-11-23 20:55:53,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:55:53,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2019-11-23 20:55:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:53,482 INFO L225 Difference]: With dead ends: 333508 [2019-11-23 20:55:53,482 INFO L226 Difference]: Without dead ends: 224864 [2019-11-23 20:55:53,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224864 states. [2019-11-23 20:55:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224864 to 217936. [2019-11-23 20:55:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217936 states. [2019-11-23 20:55:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217936 states to 217936 states and 253733 transitions. [2019-11-23 20:55:56,725 INFO L78 Accepts]: Start accepts. Automaton has 217936 states and 253733 transitions. Word has length 279 [2019-11-23 20:55:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:56,725 INFO L462 AbstractCegarLoop]: Abstraction has 217936 states and 253733 transitions. [2019-11-23 20:55:56,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:55:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 217936 states and 253733 transitions. [2019-11-23 20:55:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-23 20:55:56,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:56,790 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:55:56,790 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1190198936, now seen corresponding path program 1 times [2019-11-23 20:55:56,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:56,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517165682] [2019-11-23 20:55:56,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 20:55:56,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517165682] [2019-11-23 20:55:56,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:56,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:56,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504120378] [2019-11-23 20:55:56,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:56,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:56,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:56,960 INFO L87 Difference]: Start difference. First operand 217936 states and 253733 transitions. Second operand 4 states. [2019-11-23 20:56:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:01,308 INFO L93 Difference]: Finished difference Result 435984 states and 507676 transitions. [2019-11-23 20:56:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:01,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-11-23 20:56:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:01,543 INFO L225 Difference]: With dead ends: 435984 [2019-11-23 20:56:01,543 INFO L226 Difference]: Without dead ends: 218050 [2019-11-23 20:56:01,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218050 states. [2019-11-23 20:56:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218050 to 217936. [2019-11-23 20:56:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217936 states. [2019-11-23 20:56:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217936 states to 217936 states and 252928 transitions. [2019-11-23 20:56:07,277 INFO L78 Accepts]: Start accepts. Automaton has 217936 states and 252928 transitions. Word has length 286 [2019-11-23 20:56:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:07,278 INFO L462 AbstractCegarLoop]: Abstraction has 217936 states and 252928 transitions. [2019-11-23 20:56:07,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 217936 states and 252928 transitions. [2019-11-23 20:56:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-23 20:56:07,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:07,347 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:07,348 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash 582457027, now seen corresponding path program 1 times [2019-11-23 20:56:07,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:07,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631496043] [2019-11-23 20:56:07,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-23 20:56:07,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631496043] [2019-11-23 20:56:07,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:07,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:07,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167712706] [2019-11-23 20:56:07,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:07,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:07,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:07,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:56:07,519 INFO L87 Difference]: Start difference. First operand 217936 states and 252928 transitions. Second operand 3 states. [2019-11-23 20:56:10,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:10,114 INFO L93 Difference]: Finished difference Result 408214 states and 473629 transitions. [2019-11-23 20:56:10,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:10,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-11-23 20:56:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:10,307 INFO L225 Difference]: With dead ends: 408214 [2019-11-23 20:56:10,307 INFO L226 Difference]: Without dead ends: 190280 [2019-11-23 20:56:10,398 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 20:56:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190280 states. [2019-11-23 20:56:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190280 to 190258. [2019-11-23 20:56:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190258 states. [2019-11-23 20:56:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190258 states to 190258 states and 215527 transitions. [2019-11-23 20:56:16,369 INFO L78 Accepts]: Start accepts. Automaton has 190258 states and 215527 transitions. Word has length 299 [2019-11-23 20:56:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:16,370 INFO L462 AbstractCegarLoop]: Abstraction has 190258 states and 215527 transitions. [2019-11-23 20:56:16,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 190258 states and 215527 transitions. [2019-11-23 20:56:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-23 20:56:16,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:16,428 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:56:16,428 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1180504, now seen corresponding path program 1 times [2019-11-23 20:56:16,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:16,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376207083] [2019-11-23 20:56:16,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:56:17,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376207083] [2019-11-23 20:56:17,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:17,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:17,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525478805] [2019-11-23 20:56:17,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:17,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:17,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:17,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:17,161 INFO L87 Difference]: Start difference. First operand 190258 states and 215527 transitions. Second operand 4 states. [2019-11-23 20:56:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:19,230 INFO L93 Difference]: Finished difference Result 395154 states and 446931 transitions. [2019-11-23 20:56:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:19,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-23 20:56:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:19,424 INFO L225 Difference]: With dead ends: 395154 [2019-11-23 20:56:19,425 INFO L226 Difference]: Without dead ends: 204894 [2019-11-23 20:56:19,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204894 states. [2019-11-23 20:56:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204894 to 194115. [2019-11-23 20:56:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194115 states. [2019-11-23 20:56:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194115 states to 194115 states and 219495 transitions. [2019-11-23 20:56:25,068 INFO L78 Accepts]: Start accepts. Automaton has 194115 states and 219495 transitions. Word has length 307 [2019-11-23 20:56:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:25,068 INFO L462 AbstractCegarLoop]: Abstraction has 194115 states and 219495 transitions. [2019-11-23 20:56:25,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:56:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 194115 states and 219495 transitions. [2019-11-23 20:56:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-11-23 20:56:25,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:25,147 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:25,147 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2054214025, now seen corresponding path program 1 times [2019-11-23 20:56:25,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:25,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324576442] [2019-11-23 20:56:25,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-23 20:56:25,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324576442] [2019-11-23 20:56:25,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:25,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:56:25,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502099484] [2019-11-23 20:56:25,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:56:25,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:56:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:25,907 INFO L87 Difference]: Start difference. First operand 194115 states and 219495 transitions. Second operand 4 states. [2019-11-23 20:56:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:28,085 INFO L93 Difference]: Finished difference Result 503954 states and 570101 transitions. [2019-11-23 20:56:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:56:28,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 341 [2019-11-23 20:56:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:28,388 INFO L225 Difference]: With dead ends: 503954 [2019-11-23 20:56:28,388 INFO L226 Difference]: Without dead ends: 309841 [2019-11-23 20:56:28,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309841 states.