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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:45,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:45,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:45,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:45,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:45,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:45,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:45,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:45,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:45,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:45,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:45,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:45,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:45,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:45,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:45,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:45,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:45,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:45,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:45,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:45,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:45,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:45,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:45,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:45,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:45,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:45,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:45,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:45,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:45,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:45,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:45,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:45,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:45,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:45,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:45,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:45,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:45,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:45,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:45,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:45,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:45,683 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-10-15 01:22:45,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:45,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:45,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:45,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:45,700 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:45,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:45,702 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:45,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:45,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:45,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:45,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:45,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:45,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:45,704 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:45,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:45,705 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:45,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:45,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:45,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:45,706 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:45,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:45,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:45,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:45,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:45,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:45,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:45,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:45,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:45,708 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-10-15 01:22:45,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:45,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:45,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:45,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:45,981 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:45,982 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:22:46,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70164aaaf/f74fb58011df4c6092f8f0131517e934/FLAGc1f81b679 [2019-10-15 01:22:46,599 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:46,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:22:46,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70164aaaf/f74fb58011df4c6092f8f0131517e934/FLAGc1f81b679 [2019-10-15 01:22:46,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70164aaaf/f74fb58011df4c6092f8f0131517e934 [2019-10-15 01:22:46,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:46,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:46,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:46,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:46,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:46,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:46" (1/1) ... [2019-10-15 01:22:46,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6ee061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:46, skipping insertion in model container [2019-10-15 01:22:46,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:46" (1/1) ... [2019-10-15 01:22:46,924 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:46,988 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:47,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:47,550 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:47,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:47,718 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:47,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47 WrapperNode [2019-10-15 01:22:47,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:47,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:47,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:47,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:47,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (1/1) ... [2019-10-15 01:22:47,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (1/1) ... [2019-10-15 01:22:47,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (1/1) ... [2019-10-15 01:22:47,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (1/1) ... [2019-10-15 01:22:47,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (1/1) ... [2019-10-15 01:22:47,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (1/1) ... [2019-10-15 01:22:47,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (1/1) ... [2019-10-15 01:22:47,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:47,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:47,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:47,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:47,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (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-10-15 01:22:47,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:47,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:47,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:22:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:47,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:49,512 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:49,512 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:49,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:49 BoogieIcfgContainer [2019-10-15 01:22:49,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:49,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:49,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:49,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:49,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:46" (1/3) ... [2019-10-15 01:22:49,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9e6f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:49, skipping insertion in model container [2019-10-15 01:22:49,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:47" (2/3) ... [2019-10-15 01:22:49,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9e6f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:49, skipping insertion in model container [2019-10-15 01:22:49,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:49" (3/3) ... [2019-10-15 01:22:49,522 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:22:49,532 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:49,541 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:49,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:49,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:49,582 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:49,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:49,583 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:49,583 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:49,583 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:49,583 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:49,584 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2019-10-15 01:22:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:22:49,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:49,627 INFO L380 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-10-15 01:22:49,629 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:49,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:49,633 INFO L82 PathProgramCache]: Analyzing trace with hash 885340602, now seen corresponding path program 1 times [2019-10-15 01:22:49,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:49,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362457941] [2019-10-15 01:22:49,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:49,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:50,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362457941] [2019-10-15 01:22:50,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:50,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:50,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145312254] [2019-10-15 01:22:50,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:50,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:50,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:50,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:50,287 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 3 states. [2019-10-15 01:22:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:50,607 INFO L93 Difference]: Finished difference Result 641 states and 1120 transitions. [2019-10-15 01:22:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:50,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:22:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:50,647 INFO L225 Difference]: With dead ends: 641 [2019-10-15 01:22:50,647 INFO L226 Difference]: Without dead ends: 514 [2019-10-15 01:22:50,656 INFO L600 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-10-15 01:22:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-15 01:22:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-10-15 01:22:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-15 01:22:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-10-15 01:22:50,781 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 150 [2019-10-15 01:22:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:50,783 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-10-15 01:22:50,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-10-15 01:22:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:22:50,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:50,790 INFO L380 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-10-15 01:22:50,791 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -20093490, now seen corresponding path program 1 times [2019-10-15 01:22:50,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:50,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910992943] [2019-10-15 01:22:50,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:50,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:50,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:51,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910992943] [2019-10-15 01:22:51,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:51,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:51,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167630339] [2019-10-15 01:22:51,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:51,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:51,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:51,028 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 3 states. [2019-10-15 01:22:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:51,184 INFO L93 Difference]: Finished difference Result 1076 states and 1646 transitions. [2019-10-15 01:22:51,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:51,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:22:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:51,191 INFO L225 Difference]: With dead ends: 1076 [2019-10-15 01:22:51,191 INFO L226 Difference]: Without dead ends: 884 [2019-10-15 01:22:51,194 INFO L600 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-10-15 01:22:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-10-15 01:22:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-10-15 01:22:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-10-15 01:22:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1323 transitions. [2019-10-15 01:22:51,235 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1323 transitions. Word has length 150 [2019-10-15 01:22:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:51,235 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1323 transitions. [2019-10-15 01:22:51,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1323 transitions. [2019-10-15 01:22:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:22:51,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:51,241 INFO L380 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-10-15 01:22:51,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:51,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1175617460, now seen corresponding path program 1 times [2019-10-15 01:22:51,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:51,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549762849] [2019-10-15 01:22:51,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:51,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:51,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:51,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549762849] [2019-10-15 01:22:51,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:51,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:51,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185376074] [2019-10-15 01:22:51,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:51,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:51,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:51,681 INFO L87 Difference]: Start difference. First operand 882 states and 1323 transitions. Second operand 4 states. [2019-10-15 01:22:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:51,864 INFO L93 Difference]: Finished difference Result 2577 states and 3862 transitions. [2019-10-15 01:22:51,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:51,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-15 01:22:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:51,874 INFO L225 Difference]: With dead ends: 2577 [2019-10-15 01:22:51,875 INFO L226 Difference]: Without dead ends: 1708 [2019-10-15 01:22:51,881 INFO L600 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-10-15 01:22:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-10-15 01:22:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2019-10-15 01:22:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-10-15 01:22:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2536 transitions. [2019-10-15 01:22:51,961 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2536 transitions. Word has length 150 [2019-10-15 01:22:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:51,962 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 2536 transitions. [2019-10-15 01:22:51,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2536 transitions. [2019-10-15 01:22:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:22:51,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:51,966 INFO L380 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] [2019-10-15 01:22:51,967 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:51,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash -522806920, now seen corresponding path program 1 times [2019-10-15 01:22:51,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:51,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77495864] [2019-10-15 01:22:51,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:51,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:51,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:52,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77495864] [2019-10-15 01:22:52,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:52,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:52,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122800781] [2019-10-15 01:22:52,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:52,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:52,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:52,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:52,066 INFO L87 Difference]: Start difference. First operand 1706 states and 2536 transitions. Second operand 3 states. [2019-10-15 01:22:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:52,243 INFO L93 Difference]: Finished difference Result 5072 states and 7538 transitions. [2019-10-15 01:22:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:52,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-15 01:22:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:52,266 INFO L225 Difference]: With dead ends: 5072 [2019-10-15 01:22:52,266 INFO L226 Difference]: Without dead ends: 3398 [2019-10-15 01:22:52,273 INFO L600 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-10-15 01:22:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-15 01:22:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 1708. [2019-10-15 01:22:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-10-15 01:22:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2538 transitions. [2019-10-15 01:22:52,444 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2538 transitions. Word has length 151 [2019-10-15 01:22:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:52,444 INFO L462 AbstractCegarLoop]: Abstraction has 1708 states and 2538 transitions. [2019-10-15 01:22:52,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2538 transitions. [2019-10-15 01:22:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:22:52,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:52,449 INFO L380 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-10-15 01:22:52,449 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:52,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1124709406, now seen corresponding path program 1 times [2019-10-15 01:22:52,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:52,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273769485] [2019-10-15 01:22:52,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:52,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:52,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:52,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273769485] [2019-10-15 01:22:52,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:52,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:52,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081973100] [2019-10-15 01:22:52,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:52,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:52,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:52,653 INFO L87 Difference]: Start difference. First operand 1708 states and 2538 transitions. Second operand 3 states. [2019-10-15 01:22:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:52,929 INFO L93 Difference]: Finished difference Result 4838 states and 7205 transitions. [2019-10-15 01:22:52,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:52,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-15 01:22:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:52,948 INFO L225 Difference]: With dead ends: 4838 [2019-10-15 01:22:52,948 INFO L226 Difference]: Without dead ends: 3310 [2019-10-15 01:22:52,952 INFO L600 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-10-15 01:22:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-10-15 01:22:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3308. [2019-10-15 01:22:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-10-15 01:22:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4871 transitions. [2019-10-15 01:22:53,154 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4871 transitions. Word has length 152 [2019-10-15 01:22:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:53,155 INFO L462 AbstractCegarLoop]: Abstraction has 3308 states and 4871 transitions. [2019-10-15 01:22:53,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4871 transitions. [2019-10-15 01:22:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:22:53,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:53,162 INFO L380 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-10-15 01:22:53,162 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash -617278081, now seen corresponding path program 1 times [2019-10-15 01:22:53,163 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:53,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363259626] [2019-10-15 01:22:53,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:53,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363259626] [2019-10-15 01:22:53,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:53,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:53,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20917230] [2019-10-15 01:22:53,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:53,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:53,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:53,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:53,389 INFO L87 Difference]: Start difference. First operand 3308 states and 4871 transitions. Second operand 4 states. [2019-10-15 01:22:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:53,596 INFO L93 Difference]: Finished difference Result 5666 states and 8353 transitions. [2019-10-15 01:22:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:53,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-15 01:22:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:53,611 INFO L225 Difference]: With dead ends: 5666 [2019-10-15 01:22:53,611 INFO L226 Difference]: Without dead ends: 2528 [2019-10-15 01:22:53,620 INFO L600 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-10-15 01:22:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-10-15 01:22:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2019-10-15 01:22:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2019-10-15 01:22:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3707 transitions. [2019-10-15 01:22:53,812 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3707 transitions. Word has length 152 [2019-10-15 01:22:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:53,812 INFO L462 AbstractCegarLoop]: Abstraction has 2528 states and 3707 transitions. [2019-10-15 01:22:53,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3707 transitions. [2019-10-15 01:22:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:22:53,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:53,818 INFO L380 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] [2019-10-15 01:22:53,818 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash 696225132, now seen corresponding path program 1 times [2019-10-15 01:22:53,819 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:53,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800688973] [2019-10-15 01:22:53,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:53,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800688973] [2019-10-15 01:22:53,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:53,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:53,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742580644] [2019-10-15 01:22:53,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:53,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:53,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:53,917 INFO L87 Difference]: Start difference. First operand 2528 states and 3707 transitions. Second operand 3 states. [2019-10-15 01:22:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:54,532 INFO L93 Difference]: Finished difference Result 6812 states and 10094 transitions. [2019-10-15 01:22:54,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:54,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-15 01:22:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:54,555 INFO L225 Difference]: With dead ends: 6812 [2019-10-15 01:22:54,555 INFO L226 Difference]: Without dead ends: 4696 [2019-10-15 01:22:54,560 INFO L600 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-10-15 01:22:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-10-15 01:22:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4694. [2019-10-15 01:22:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-10-15 01:22:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 6887 transitions. [2019-10-15 01:22:54,809 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 6887 transitions. Word has length 158 [2019-10-15 01:22:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:54,810 INFO L462 AbstractCegarLoop]: Abstraction has 4694 states and 6887 transitions. [2019-10-15 01:22:54,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 6887 transitions. [2019-10-15 01:22:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:22:54,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:54,818 INFO L380 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] [2019-10-15 01:22:54,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1185599087, now seen corresponding path program 1 times [2019-10-15 01:22:54,819 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:54,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892247627] [2019-10-15 01:22:54,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:54,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:55,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892247627] [2019-10-15 01:22:55,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:55,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:22:55,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617618285] [2019-10-15 01:22:55,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:22:55,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:55,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:22:55,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:22:55,410 INFO L87 Difference]: Start difference. First operand 4694 states and 6887 transitions. Second operand 15 states. [2019-10-15 01:22:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:57,734 INFO L93 Difference]: Finished difference Result 12388 states and 19102 transitions. [2019-10-15 01:22:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:22:57,734 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2019-10-15 01:22:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:57,777 INFO L225 Difference]: With dead ends: 12388 [2019-10-15 01:22:57,777 INFO L226 Difference]: Without dead ends: 8416 [2019-10-15 01:22:57,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:22:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2019-10-15 01:22:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 6432. [2019-10-15 01:22:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6432 states. [2019-10-15 01:22:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 9844 transitions. [2019-10-15 01:22:58,194 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 9844 transitions. Word has length 158 [2019-10-15 01:22:58,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,195 INFO L462 AbstractCegarLoop]: Abstraction has 6432 states and 9844 transitions. [2019-10-15 01:22:58,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:22:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 9844 transitions. [2019-10-15 01:22:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:22:58,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,203 INFO L380 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] [2019-10-15 01:22:58,204 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash 11065959, now seen corresponding path program 1 times [2019-10-15 01:22:58,205 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125644563] [2019-10-15 01:22:58,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:58,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125644563] [2019-10-15 01:22:58,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:22:58,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596834352] [2019-10-15 01:22:58,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:22:58,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:22:58,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:22:58,512 INFO L87 Difference]: Start difference. First operand 6432 states and 9844 transitions. Second operand 9 states. [2019-10-15 01:22:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:59,239 INFO L93 Difference]: Finished difference Result 13818 states and 21476 transitions. [2019-10-15 01:22:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:59,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-15 01:22:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:59,264 INFO L225 Difference]: With dead ends: 13818 [2019-10-15 01:22:59,264 INFO L226 Difference]: Without dead ends: 9628 [2019-10-15 01:22:59,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:22:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9628 states. [2019-10-15 01:22:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9628 to 7796. [2019-10-15 01:22:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7796 states. [2019-10-15 01:22:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 11622 transitions. [2019-10-15 01:22:59,743 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 11622 transitions. Word has length 158 [2019-10-15 01:22:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:59,744 INFO L462 AbstractCegarLoop]: Abstraction has 7796 states and 11622 transitions. [2019-10-15 01:22:59,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:22:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 11622 transitions. [2019-10-15 01:22:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:22:59,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:59,754 INFO L380 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] [2019-10-15 01:22:59,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash -362607228, now seen corresponding path program 1 times [2019-10-15 01:22:59,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:59,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553629063] [2019-10-15 01:22:59,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:59,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553629063] [2019-10-15 01:22:59,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:59,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:22:59,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451024686] [2019-10-15 01:22:59,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:22:59,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:22:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:59,961 INFO L87 Difference]: Start difference. First operand 7796 states and 11622 transitions. Second operand 5 states. [2019-10-15 01:23:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:00,861 INFO L93 Difference]: Finished difference Result 16045 states and 25162 transitions. [2019-10-15 01:23:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:00,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-15 01:23:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:00,898 INFO L225 Difference]: With dead ends: 16045 [2019-10-15 01:23:00,899 INFO L226 Difference]: Without dead ends: 14207 [2019-10-15 01:23:00,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14207 states. [2019-10-15 01:23:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14207 to 10541. [2019-10-15 01:23:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10541 states. [2019-10-15 01:23:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10541 states to 10541 states and 16098 transitions. [2019-10-15 01:23:01,587 INFO L78 Accepts]: Start accepts. Automaton has 10541 states and 16098 transitions. Word has length 158 [2019-10-15 01:23:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,587 INFO L462 AbstractCegarLoop]: Abstraction has 10541 states and 16098 transitions. [2019-10-15 01:23:01,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 10541 states and 16098 transitions. [2019-10-15 01:23:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:23:01,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,598 INFO L380 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] [2019-10-15 01:23:01,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1963094895, now seen corresponding path program 1 times [2019-10-15 01:23:01,599 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267842475] [2019-10-15 01:23:01,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:01,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267842475] [2019-10-15 01:23:01,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:01,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659348096] [2019-10-15 01:23:01,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:01,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:01,791 INFO L87 Difference]: Start difference. First operand 10541 states and 16098 transitions. Second operand 4 states. [2019-10-15 01:23:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:02,687 INFO L93 Difference]: Finished difference Result 27660 states and 42237 transitions. [2019-10-15 01:23:02,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:02,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-15 01:23:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:02,728 INFO L225 Difference]: With dead ends: 27660 [2019-10-15 01:23:02,729 INFO L226 Difference]: Without dead ends: 17128 [2019-10-15 01:23:02,749 INFO L600 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-10-15 01:23:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2019-10-15 01:23:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 17126. [2019-10-15 01:23:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17126 states. [2019-10-15 01:23:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 25905 transitions. [2019-10-15 01:23:04,334 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 25905 transitions. Word has length 158 [2019-10-15 01:23:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:04,335 INFO L462 AbstractCegarLoop]: Abstraction has 17126 states and 25905 transitions. [2019-10-15 01:23:04,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 25905 transitions. [2019-10-15 01:23:04,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:23:04,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:04,352 INFO L380 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] [2019-10-15 01:23:04,352 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:04,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:04,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1251669041, now seen corresponding path program 1 times [2019-10-15 01:23:04,353 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:04,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789744087] [2019-10-15 01:23:04,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:04,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:04,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:04,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789744087] [2019-10-15 01:23:04,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:04,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:04,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536682300] [2019-10-15 01:23:04,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:04,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:04,469 INFO L87 Difference]: Start difference. First operand 17126 states and 25905 transitions. Second operand 3 states. [2019-10-15 01:23:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:05,660 INFO L93 Difference]: Finished difference Result 46538 states and 70297 transitions. [2019-10-15 01:23:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:05,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-15 01:23:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:05,718 INFO L225 Difference]: With dead ends: 46538 [2019-10-15 01:23:05,718 INFO L226 Difference]: Without dead ends: 29773 [2019-10-15 01:23:05,749 INFO L600 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-10-15 01:23:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29773 states. [2019-10-15 01:23:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29773 to 29771. [2019-10-15 01:23:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29771 states. [2019-10-15 01:23:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29771 states to 29771 states and 44403 transitions. [2019-10-15 01:23:07,503 INFO L78 Accepts]: Start accepts. Automaton has 29771 states and 44403 transitions. Word has length 160 [2019-10-15 01:23:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:07,504 INFO L462 AbstractCegarLoop]: Abstraction has 29771 states and 44403 transitions. [2019-10-15 01:23:07,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 29771 states and 44403 transitions. [2019-10-15 01:23:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:23:07,524 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:07,525 INFO L380 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] [2019-10-15 01:23:07,525 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:07,525 INFO L82 PathProgramCache]: Analyzing trace with hash -488936532, now seen corresponding path program 1 times [2019-10-15 01:23:07,526 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:07,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895382921] [2019-10-15 01:23:07,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:07,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895382921] [2019-10-15 01:23:07,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:07,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:07,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348622665] [2019-10-15 01:23:07,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:07,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:07,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:07,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:07,662 INFO L87 Difference]: Start difference. First operand 29771 states and 44403 transitions. Second operand 4 states. [2019-10-15 01:23:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:08,853 INFO L93 Difference]: Finished difference Result 49776 states and 74234 transitions. [2019-10-15 01:23:08,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:08,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-15 01:23:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:08,891 INFO L225 Difference]: With dead ends: 49776 [2019-10-15 01:23:08,891 INFO L226 Difference]: Without dead ends: 26850 [2019-10-15 01:23:08,924 INFO L600 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-10-15 01:23:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26850 states. [2019-10-15 01:23:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26850 to 26850. [2019-10-15 01:23:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26850 states. [2019-10-15 01:23:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26850 states to 26850 states and 40034 transitions. [2019-10-15 01:23:11,119 INFO L78 Accepts]: Start accepts. Automaton has 26850 states and 40034 transitions. Word has length 160 [2019-10-15 01:23:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:11,119 INFO L462 AbstractCegarLoop]: Abstraction has 26850 states and 40034 transitions. [2019-10-15 01:23:11,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 26850 states and 40034 transitions. [2019-10-15 01:23:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:23:11,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:11,135 INFO L380 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, 1] [2019-10-15 01:23:11,135 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1120267668, now seen corresponding path program 1 times [2019-10-15 01:23:11,136 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:11,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537501944] [2019-10-15 01:23:11,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:11,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:11,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:11,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537501944] [2019-10-15 01:23:11,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:11,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:11,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876919875] [2019-10-15 01:23:11,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:11,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:11,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:11,250 INFO L87 Difference]: Start difference. First operand 26850 states and 40034 transitions. Second operand 3 states. [2019-10-15 01:23:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:12,803 INFO L93 Difference]: Finished difference Result 51482 states and 79000 transitions. [2019-10-15 01:23:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:12,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-15 01:23:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:12,855 INFO L225 Difference]: With dead ends: 51482 [2019-10-15 01:23:12,855 INFO L226 Difference]: Without dead ends: 35028 [2019-10-15 01:23:12,880 INFO L600 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-10-15 01:23:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2019-10-15 01:23:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 32518. [2019-10-15 01:23:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32518 states. [2019-10-15 01:23:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32518 states to 32518 states and 48470 transitions. [2019-10-15 01:23:14,475 INFO L78 Accepts]: Start accepts. Automaton has 32518 states and 48470 transitions. Word has length 166 [2019-10-15 01:23:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:14,476 INFO L462 AbstractCegarLoop]: Abstraction has 32518 states and 48470 transitions. [2019-10-15 01:23:14,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32518 states and 48470 transitions. [2019-10-15 01:23:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:23:14,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:14,488 INFO L380 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, 1] [2019-10-15 01:23:14,488 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:14,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1417380321, now seen corresponding path program 1 times [2019-10-15 01:23:14,488 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:14,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285009204] [2019-10-15 01:23:14,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:14,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:14,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:14,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285009204] [2019-10-15 01:23:14,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:14,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:14,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33810967] [2019-10-15 01:23:14,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:14,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:14,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:14,655 INFO L87 Difference]: Start difference. First operand 32518 states and 48470 transitions. Second operand 5 states. [2019-10-15 01:23:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:18,303 INFO L93 Difference]: Finished difference Result 74926 states and 115502 transitions. [2019-10-15 01:23:18,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:18,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-10-15 01:23:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:18,369 INFO L225 Difference]: With dead ends: 74926 [2019-10-15 01:23:18,369 INFO L226 Difference]: Without dead ends: 57596 [2019-10-15 01:23:18,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57596 states. [2019-10-15 01:23:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57596 to 34850. [2019-10-15 01:23:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34850 states. [2019-10-15 01:23:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34850 states to 34850 states and 52226 transitions. [2019-10-15 01:23:20,233 INFO L78 Accepts]: Start accepts. Automaton has 34850 states and 52226 transitions. Word has length 166 [2019-10-15 01:23:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:20,233 INFO L462 AbstractCegarLoop]: Abstraction has 34850 states and 52226 transitions. [2019-10-15 01:23:20,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:20,234 INFO L276 IsEmpty]: Start isEmpty. Operand 34850 states and 52226 transitions. [2019-10-15 01:23:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-15 01:23:20,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:20,246 INFO L380 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, 1] [2019-10-15 01:23:20,246 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1681876025, now seen corresponding path program 1 times [2019-10-15 01:23:20,247 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:20,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228450297] [2019-10-15 01:23:20,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat