/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:05:10,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:10,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:10,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:10,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:10,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:10,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:10,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:10,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:10,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:10,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:10,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:10,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:10,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:10,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:10,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:10,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:10,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:10,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:10,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:10,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:10,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:10,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:10,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:10,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:10,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:10,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:10,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:10,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:10,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:10,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:10,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:10,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:10,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:10,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:10,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:10,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:10,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:10,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:10,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:10,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:10,373 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-07 01:05:10,388 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:10,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:10,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:10,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:10,390 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:10,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:10,390 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:10,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:10,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:10,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:10,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:10,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:10,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:10,391 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:10,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:10,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:10,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:10,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:10,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:10,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:10,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:10,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:10,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:10,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:10,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:10,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:10,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:10,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:10,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:05:10,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:10,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:10,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:10,695 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:10,695 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:10,696 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:05:10,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a99496f/5a3742081edb4f41a2b67adeb4eca1af/FLAG68b1a4afb [2019-11-07 01:05:11,345 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:11,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:05:11,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a99496f/5a3742081edb4f41a2b67adeb4eca1af/FLAG68b1a4afb [2019-11-07 01:05:11,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a99496f/5a3742081edb4f41a2b67adeb4eca1af [2019-11-07 01:05:11,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:11,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:11,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:11,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:11,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:11,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:11" (1/1) ... [2019-11-07 01:05:11,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c2ed43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:11, skipping insertion in model container [2019-11-07 01:05:11,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:11" (1/1) ... [2019-11-07 01:05:11,626 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:11,701 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:12,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:12,204 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:12,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:12,399 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:12,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12 WrapperNode [2019-11-07 01:05:12,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:12,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:12,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:12,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:12,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (1/1) ... [2019-11-07 01:05:12,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:12,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:12,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:12,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:12,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (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-07 01:05:12,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:12,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:12,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:12,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:12,592 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:12,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:12,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:12,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:14,034 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:14,034 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:14,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:14 BoogieIcfgContainer [2019-11-07 01:05:14,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:14,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:14,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:14,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:14,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:11" (1/3) ... [2019-11-07 01:05:14,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5511cb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:14, skipping insertion in model container [2019-11-07 01:05:14,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:12" (2/3) ... [2019-11-07 01:05:14,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5511cb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:14, skipping insertion in model container [2019-11-07 01:05:14,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:14" (3/3) ... [2019-11-07 01:05:14,046 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:05:14,058 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:14,068 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:05:14,080 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:05:14,110 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:14,110 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:14,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:14,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:14,111 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:14,111 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:14,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:14,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states. [2019-11-07 01:05:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 01:05:14,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:14,152 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] [2019-11-07 01:05:14,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1545579630, now seen corresponding path program 1 times [2019-11-07 01:05:14,166 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:14,166 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480223449] [2019-11-07 01:05:14,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:14,838 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-07 01:05:14,839 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480223449] [2019-11-07 01:05:14,840 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:14,840 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:14,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94870695] [2019-11-07 01:05:14,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:14,849 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:14,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:14,867 INFO L87 Difference]: Start difference. First operand 299 states. Second operand 3 states. [2019-11-07 01:05:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:15,144 INFO L93 Difference]: Finished difference Result 569 states and 997 transitions. [2019-11-07 01:05:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:15,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-07 01:05:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:15,164 INFO L225 Difference]: With dead ends: 569 [2019-11-07 01:05:15,164 INFO L226 Difference]: Without dead ends: 465 [2019-11-07 01:05:15,168 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-07 01:05:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-07 01:05:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2019-11-07 01:05:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-11-07 01:05:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 686 transitions. [2019-11-07 01:05:15,254 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 686 transitions. Word has length 145 [2019-11-07 01:05:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:15,255 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 686 transitions. [2019-11-07 01:05:15,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 686 transitions. [2019-11-07 01:05:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 01:05:15,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:15,260 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] [2019-11-07 01:05:15,260 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1852792009, now seen corresponding path program 1 times [2019-11-07 01:05:15,261 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:15,262 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890505903] [2019-11-07 01:05:15,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:15,767 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-07 01:05:15,767 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890505903] [2019-11-07 01:05:15,768 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:15,768 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:15,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209629082] [2019-11-07 01:05:15,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:15,770 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:15,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:15,771 INFO L87 Difference]: Start difference. First operand 463 states and 686 transitions. Second operand 4 states. [2019-11-07 01:05:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:15,914 INFO L93 Difference]: Finished difference Result 1349 states and 1997 transitions. [2019-11-07 01:05:15,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:15,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-07 01:05:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:15,921 INFO L225 Difference]: With dead ends: 1349 [2019-11-07 01:05:15,921 INFO L226 Difference]: Without dead ends: 899 [2019-11-07 01:05:15,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-11-07 01:05:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 897. [2019-11-07 01:05:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-11-07 01:05:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1319 transitions. [2019-11-07 01:05:16,010 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1319 transitions. Word has length 145 [2019-11-07 01:05:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:16,011 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1319 transitions. [2019-11-07 01:05:16,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1319 transitions. [2019-11-07 01:05:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-07 01:05:16,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:16,020 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] [2019-11-07 01:05:16,021 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:16,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:16,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1132437897, now seen corresponding path program 1 times [2019-11-07 01:05:16,023 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:16,023 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571746925] [2019-11-07 01:05:16,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:16,183 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-07 01:05:16,184 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571746925] [2019-11-07 01:05:16,184 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:16,184 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:16,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512783252] [2019-11-07 01:05:16,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:16,186 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:16,187 INFO L87 Difference]: Start difference. First operand 897 states and 1319 transitions. Second operand 3 states. [2019-11-07 01:05:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:16,272 INFO L93 Difference]: Finished difference Result 2645 states and 3887 transitions. [2019-11-07 01:05:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:16,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-07 01:05:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:16,283 INFO L225 Difference]: With dead ends: 2645 [2019-11-07 01:05:16,284 INFO L226 Difference]: Without dead ends: 1780 [2019-11-07 01:05:16,287 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-07 01:05:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-11-07 01:05:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 899. [2019-11-07 01:05:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-11-07 01:05:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1321 transitions. [2019-11-07 01:05:16,348 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1321 transitions. Word has length 146 [2019-11-07 01:05:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:16,349 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1321 transitions. [2019-11-07 01:05:16,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1321 transitions. [2019-11-07 01:05:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:16,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:16,352 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] [2019-11-07 01:05:16,352 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:16,353 INFO L82 PathProgramCache]: Analyzing trace with hash 18878169, now seen corresponding path program 1 times [2019-11-07 01:05:16,353 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:16,353 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635572760] [2019-11-07 01:05:16,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:16,481 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-07 01:05:16,482 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635572760] [2019-11-07 01:05:16,482 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:16,482 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:16,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940003302] [2019-11-07 01:05:16,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:16,483 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:16,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:16,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:16,484 INFO L87 Difference]: Start difference. First operand 899 states and 1321 transitions. Second operand 3 states. [2019-11-07 01:05:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:16,680 INFO L93 Difference]: Finished difference Result 2451 states and 3620 transitions. [2019-11-07 01:05:16,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:16,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-07 01:05:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:16,692 INFO L225 Difference]: With dead ends: 2451 [2019-11-07 01:05:16,692 INFO L226 Difference]: Without dead ends: 1734 [2019-11-07 01:05:16,695 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-07 01:05:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-07 01:05:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-11-07 01:05:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-11-07 01:05:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2523 transitions. [2019-11-07 01:05:16,837 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2523 transitions. Word has length 147 [2019-11-07 01:05:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:16,837 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2523 transitions. [2019-11-07 01:05:16,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2523 transitions. [2019-11-07 01:05:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 01:05:16,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:16,845 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] [2019-11-07 01:05:16,845 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1632040732, now seen corresponding path program 1 times [2019-11-07 01:05:16,846 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:16,847 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406659267] [2019-11-07 01:05:16,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:17,078 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-07 01:05:17,078 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406659267] [2019-11-07 01:05:17,079 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:17,079 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:17,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389949275] [2019-11-07 01:05:17,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:17,081 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:17,081 INFO L87 Difference]: Start difference. First operand 1732 states and 2523 transitions. Second operand 4 states. [2019-11-07 01:05:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:17,224 INFO L93 Difference]: Finished difference Result 2881 states and 4212 transitions. [2019-11-07 01:05:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:17,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-07 01:05:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:17,232 INFO L225 Difference]: With dead ends: 2881 [2019-11-07 01:05:17,233 INFO L226 Difference]: Without dead ends: 1321 [2019-11-07 01:05:17,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-11-07 01:05:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-11-07 01:05:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-11-07 01:05:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1916 transitions. [2019-11-07 01:05:17,323 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1916 transitions. Word has length 147 [2019-11-07 01:05:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:17,323 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 1916 transitions. [2019-11-07 01:05:17,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1916 transitions. [2019-11-07 01:05:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:05:17,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:17,327 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] [2019-11-07 01:05:17,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1705432715, now seen corresponding path program 1 times [2019-11-07 01:05:17,328 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:17,328 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121361404] [2019-11-07 01:05:17,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:17,565 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-07 01:05:17,565 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121361404] [2019-11-07 01:05:17,566 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:17,566 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:05:17,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536060607] [2019-11-07 01:05:17,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:05:17,567 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:17,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:05:17,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:17,568 INFO L87 Difference]: Start difference. First operand 1321 states and 1916 transitions. Second operand 8 states. [2019-11-07 01:05:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:18,516 INFO L93 Difference]: Finished difference Result 3867 states and 5900 transitions. [2019-11-07 01:05:18,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:05:18,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-11-07 01:05:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:18,531 INFO L225 Difference]: With dead ends: 3867 [2019-11-07 01:05:18,532 INFO L226 Difference]: Without dead ends: 2751 [2019-11-07 01:05:18,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-07 01:05:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-11-07 01:05:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 1652. [2019-11-07 01:05:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-11-07 01:05:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2413 transitions. [2019-11-07 01:05:18,674 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2413 transitions. Word has length 150 [2019-11-07 01:05:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:18,674 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 2413 transitions. [2019-11-07 01:05:18,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:05:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2413 transitions. [2019-11-07 01:05:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-07 01:05:18,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:18,682 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] [2019-11-07 01:05:18,682 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:18,683 INFO L82 PathProgramCache]: Analyzing trace with hash -912214424, now seen corresponding path program 1 times [2019-11-07 01:05:18,683 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:18,691 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795995557] [2019-11-07 01:05:18,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:18,943 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-07 01:05:18,944 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795995557] [2019-11-07 01:05:18,944 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:18,944 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:18,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507632433] [2019-11-07 01:05:18,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:18,945 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:18,946 INFO L87 Difference]: Start difference. First operand 1652 states and 2413 transitions. Second operand 4 states. [2019-11-07 01:05:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:19,294 INFO L93 Difference]: Finished difference Result 4332 states and 6340 transitions. [2019-11-07 01:05:19,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:19,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-07 01:05:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:19,315 INFO L225 Difference]: With dead ends: 4332 [2019-11-07 01:05:19,316 INFO L226 Difference]: Without dead ends: 2703 [2019-11-07 01:05:19,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-11-07 01:05:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2701. [2019-11-07 01:05:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2019-11-07 01:05:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3924 transitions. [2019-11-07 01:05:19,747 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3924 transitions. Word has length 150 [2019-11-07 01:05:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:19,748 INFO L462 AbstractCegarLoop]: Abstraction has 2701 states and 3924 transitions. [2019-11-07 01:05:19,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3924 transitions. [2019-11-07 01:05:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:05:19,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:19,756 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] [2019-11-07 01:05:19,757 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:19,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1681251574, now seen corresponding path program 1 times [2019-11-07 01:05:19,758 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:19,758 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217778549] [2019-11-07 01:05:19,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:19,930 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-07 01:05:19,930 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217778549] [2019-11-07 01:05:19,931 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:19,931 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:19,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305371411] [2019-11-07 01:05:19,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:19,932 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:19,933 INFO L87 Difference]: Start difference. First operand 2701 states and 3924 transitions. Second operand 3 states. [2019-11-07 01:05:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:20,372 INFO L93 Difference]: Finished difference Result 7038 states and 10298 transitions. [2019-11-07 01:05:20,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:20,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-07 01:05:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:20,395 INFO L225 Difference]: With dead ends: 7038 [2019-11-07 01:05:20,395 INFO L226 Difference]: Without dead ends: 4666 [2019-11-07 01:05:20,401 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-07 01:05:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-11-07 01:05:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4664. [2019-11-07 01:05:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-11-07 01:05:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 6720 transitions. [2019-11-07 01:05:20,763 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 6720 transitions. Word has length 152 [2019-11-07 01:05:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:20,764 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 6720 transitions. [2019-11-07 01:05:20,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 6720 transitions. [2019-11-07 01:05:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-07 01:05:20,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:20,773 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] [2019-11-07 01:05:20,773 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash -344412185, now seen corresponding path program 1 times [2019-11-07 01:05:20,774 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:20,774 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125922182] [2019-11-07 01:05:20,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:20,942 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-07 01:05:20,942 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125922182] [2019-11-07 01:05:20,943 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:20,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:20,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129405090] [2019-11-07 01:05:20,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:20,945 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:20,946 INFO L87 Difference]: Start difference. First operand 4664 states and 6720 transitions. Second operand 4 states. [2019-11-07 01:05:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:21,323 INFO L93 Difference]: Finished difference Result 7769 states and 11256 transitions. [2019-11-07 01:05:21,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:21,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-07 01:05:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:21,341 INFO L225 Difference]: With dead ends: 7769 [2019-11-07 01:05:21,342 INFO L226 Difference]: Without dead ends: 4098 [2019-11-07 01:05:21,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-11-07 01:05:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-11-07 01:05:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-07 01:05:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5895 transitions. [2019-11-07 01:05:21,706 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5895 transitions. Word has length 152 [2019-11-07 01:05:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:21,706 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 5895 transitions. [2019-11-07 01:05:21,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5895 transitions. [2019-11-07 01:05:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:05:21,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:21,716 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] [2019-11-07 01:05:21,716 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash 71132805, now seen corresponding path program 1 times [2019-11-07 01:05:21,717 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:21,717 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979342763] [2019-11-07 01:05:21,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:21,823 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-07 01:05:21,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979342763] [2019-11-07 01:05:21,824 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:21,824 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:21,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549523795] [2019-11-07 01:05:21,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:21,826 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:21,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:21,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:21,826 INFO L87 Difference]: Start difference. First operand 4098 states and 5895 transitions. Second operand 3 states. [2019-11-07 01:05:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:22,569 INFO L93 Difference]: Finished difference Result 10865 states and 15855 transitions. [2019-11-07 01:05:22,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:22,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-07 01:05:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:22,633 INFO L225 Difference]: With dead ends: 10865 [2019-11-07 01:05:22,633 INFO L226 Difference]: Without dead ends: 7902 [2019-11-07 01:05:22,648 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-07 01:05:22,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2019-11-07 01:05:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7900. [2019-11-07 01:05:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-11-07 01:05:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 11351 transitions. [2019-11-07 01:05:23,331 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 11351 transitions. Word has length 155 [2019-11-07 01:05:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:23,332 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 11351 transitions. [2019-11-07 01:05:23,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 11351 transitions. [2019-11-07 01:05:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:05:23,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:23,342 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] [2019-11-07 01:05:23,342 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1126763328, now seen corresponding path program 1 times [2019-11-07 01:05:23,342 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:23,343 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036368830] [2019-11-07 01:05:23,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:23,556 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-07 01:05:23,557 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036368830] [2019-11-07 01:05:23,557 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:23,557 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:23,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115493564] [2019-11-07 01:05:23,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:23,558 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:23,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:23,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:23,558 INFO L87 Difference]: Start difference. First operand 7900 states and 11351 transitions. Second operand 4 states. [2019-11-07 01:05:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:24,701 INFO L93 Difference]: Finished difference Result 23082 states and 33193 transitions. [2019-11-07 01:05:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:24,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-07 01:05:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:24,735 INFO L225 Difference]: With dead ends: 23082 [2019-11-07 01:05:24,735 INFO L226 Difference]: Without dead ends: 15225 [2019-11-07 01:05:24,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2019-11-07 01:05:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 15223. [2019-11-07 01:05:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15223 states. [2019-11-07 01:05:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 21696 transitions. [2019-11-07 01:05:26,085 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 21696 transitions. Word has length 155 [2019-11-07 01:05:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:26,085 INFO L462 AbstractCegarLoop]: Abstraction has 15223 states and 21696 transitions. [2019-11-07 01:05:26,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 21696 transitions. [2019-11-07 01:05:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:05:26,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:26,102 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] [2019-11-07 01:05:26,103 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1208295678, now seen corresponding path program 1 times [2019-11-07 01:05:26,103 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:26,103 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808415186] [2019-11-07 01:05:26,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:26,164 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-07 01:05:26,164 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808415186] [2019-11-07 01:05:26,165 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:26,165 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:26,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689929862] [2019-11-07 01:05:26,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:26,166 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:26,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:26,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:26,167 INFO L87 Difference]: Start difference. First operand 15223 states and 21696 transitions. Second operand 3 states. [2019-11-07 01:05:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:28,561 INFO L93 Difference]: Finished difference Result 45469 states and 64831 transitions. [2019-11-07 01:05:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:28,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-07 01:05:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:28,627 INFO L225 Difference]: With dead ends: 45469 [2019-11-07 01:05:28,627 INFO L226 Difference]: Without dead ends: 30355 [2019-11-07 01:05:28,659 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-07 01:05:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30355 states. [2019-11-07 01:05:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30355 to 15229. [2019-11-07 01:05:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15229 states. [2019-11-07 01:05:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15229 states to 15229 states and 21702 transitions. [2019-11-07 01:05:29,877 INFO L78 Accepts]: Start accepts. Automaton has 15229 states and 21702 transitions. Word has length 156 [2019-11-07 01:05:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:29,877 INFO L462 AbstractCegarLoop]: Abstraction has 15229 states and 21702 transitions. [2019-11-07 01:05:29,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 15229 states and 21702 transitions. [2019-11-07 01:05:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:05:29,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:29,895 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-07 01:05:29,896 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:29,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1010309857, now seen corresponding path program 1 times [2019-11-07 01:05:29,896 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:29,896 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562254523] [2019-11-07 01:05:29,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:30,056 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-07 01:05:30,057 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562254523] [2019-11-07 01:05:30,060 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:30,061 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:30,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238300216] [2019-11-07 01:05:30,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:30,062 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:30,062 INFO L87 Difference]: Start difference. First operand 15229 states and 21702 transitions. Second operand 4 states. [2019-11-07 01:05:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:31,096 INFO L93 Difference]: Finished difference Result 30416 states and 43348 transitions. [2019-11-07 01:05:31,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:31,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-07 01:05:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:31,123 INFO L225 Difference]: With dead ends: 30416 [2019-11-07 01:05:31,123 INFO L226 Difference]: Without dead ends: 15223 [2019-11-07 01:05:31,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15223 states. [2019-11-07 01:05:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15223 to 15223. [2019-11-07 01:05:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15223 states. [2019-11-07 01:05:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 21690 transitions. [2019-11-07 01:05:32,623 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 21690 transitions. Word has length 157 [2019-11-07 01:05:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:32,624 INFO L462 AbstractCegarLoop]: Abstraction has 15223 states and 21690 transitions. [2019-11-07 01:05:32,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 21690 transitions. [2019-11-07 01:05:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:05:32,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:32,641 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-07 01:05:32,641 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:32,641 INFO L82 PathProgramCache]: Analyzing trace with hash -702669460, now seen corresponding path program 1 times [2019-11-07 01:05:32,642 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:32,642 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879035048] [2019-11-07 01:05:32,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:32,785 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-07 01:05:32,785 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879035048] [2019-11-07 01:05:32,786 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:32,786 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:32,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715051921] [2019-11-07 01:05:32,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:32,787 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:32,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:32,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:32,788 INFO L87 Difference]: Start difference. First operand 15223 states and 21690 transitions. Second operand 3 states. [2019-11-07 01:05:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:34,208 INFO L93 Difference]: Finished difference Result 36857 states and 52495 transitions. [2019-11-07 01:05:34,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:34,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-07 01:05:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:34,245 INFO L225 Difference]: With dead ends: 36857 [2019-11-07 01:05:34,245 INFO L226 Difference]: Without dead ends: 22575 [2019-11-07 01:05:34,268 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-07 01:05:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22575 states. [2019-11-07 01:05:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22575 to 22573. [2019-11-07 01:05:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22573 states. [2019-11-07 01:05:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22573 states to 22573 states and 31549 transitions. [2019-11-07 01:05:35,880 INFO L78 Accepts]: Start accepts. Automaton has 22573 states and 31549 transitions. Word has length 157 [2019-11-07 01:05:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:35,881 INFO L462 AbstractCegarLoop]: Abstraction has 22573 states and 31549 transitions. [2019-11-07 01:05:35,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 22573 states and 31549 transitions. [2019-11-07 01:05:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-07 01:05:35,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:35,901 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, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:35,901 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash 586917850, now seen corresponding path program 1 times [2019-11-07 01:05:35,902 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:35,902 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951910370] [2019-11-07 01:05:35,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:36,115 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-07 01:05:36,115 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951910370] [2019-11-07 01:05:36,115 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:36,116 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:36,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844550014] [2019-11-07 01:05:36,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:36,116 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:36,117 INFO L87 Difference]: Start difference. First operand 22573 states and 31549 transitions. Second operand 4 states. [2019-11-07 01:05:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:37,862 INFO L93 Difference]: Finished difference Result 42369 states and 59188 transitions. [2019-11-07 01:05:37,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:37,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-07 01:05:37,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:37,896 INFO L225 Difference]: With dead ends: 42369 [2019-11-07 01:05:37,897 INFO L226 Difference]: Without dead ends: 20147 [2019-11-07 01:05:37,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20147 states. [2019-11-07 01:05:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20147 to 20078. [2019-11-07 01:05:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20078 states. [2019-11-07 01:05:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20078 states to 20078 states and 27953 transitions. [2019-11-07 01:05:39,186 INFO L78 Accepts]: Start accepts. Automaton has 20078 states and 27953 transitions. Word has length 163 [2019-11-07 01:05:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:39,187 INFO L462 AbstractCegarLoop]: Abstraction has 20078 states and 27953 transitions. [2019-11-07 01:05:39,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:05:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20078 states and 27953 transitions. [2019-11-07 01:05:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-07 01:05:39,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:39,206 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:39,206 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash 330827924, now seen corresponding path program 1 times [2019-11-07 01:05:39,207 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:39,207 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844779923] [2019-11-07 01:05:39,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:39,522 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-07 01:05:39,525 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844779923] [2019-11-07 01:05:39,526 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:39,526 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:05:39,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423069901] [2019-11-07 01:05:39,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:05:39,527 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:05:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:05:39,528 INFO L87 Difference]: Start difference. First operand 20078 states and 27953 transitions. Second operand 4 states. [2019-11-07 01:05:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:40,582 INFO L93 Difference]: Finished difference Result 40252 states and 56019 transitions. [2019-11-07 01:05:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:05:40,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-07 01:05:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:40,604 INFO L225 Difference]: With dead ends: 40252 [2019-11-07 01:05:40,605 INFO L226 Difference]: Without dead ends: 20329 [2019-11-07 01:05:40,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20329 states.