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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:41,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:41,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:41,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:41,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:41,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:41,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:41,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:41,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:41,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:41,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:41,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:41,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:41,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:41,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:41,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:41,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:41,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:41,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:41,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:41,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:41,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:41,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:41,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:41,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:41,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:41,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:41,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:41,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:41,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:41,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:41,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:41,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:41,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:41,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:41,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:41,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:41,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:41,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:41,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:41,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:41,737 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-13 21:24:41,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:41,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:41,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:41,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:41,760 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:41,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:41,760 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:41,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:41,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:41,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:41,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:41,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:41,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:41,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:41,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:41,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:41,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:41,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:41,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:41,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:41,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:41,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:41,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:41,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:41,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:41,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:41,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:41,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:41,765 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-13 21:24:42,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:42,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:42,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:42,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:42,073 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:42,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:42,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbdc1389f/6398eb77d9824db8b3ba8138ed926812/FLAG7358732cb [2019-10-13 21:24:42,672 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:42,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:42,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbdc1389f/6398eb77d9824db8b3ba8138ed926812/FLAG7358732cb [2019-10-13 21:24:42,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbdc1389f/6398eb77d9824db8b3ba8138ed926812 [2019-10-13 21:24:42,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:42,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:42,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:42,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:42,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:42,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:42" (1/1) ... [2019-10-13 21:24:42,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ecbcbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:42, skipping insertion in model container [2019-10-13 21:24:42,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:42" (1/1) ... [2019-10-13 21:24:42,994 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:43,053 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:43,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:43,563 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:43,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:43,706 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:43,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43 WrapperNode [2019-10-13 21:24:43,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:43,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:43,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:43,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:43,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (1/1) ... [2019-10-13 21:24:43,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:43,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:43,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:43,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:43,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (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-13 21:24:43,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:43,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:43,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:43,889 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:43,889 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:43,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:45,219 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:45,219 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:45,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:45 BoogieIcfgContainer [2019-10-13 21:24:45,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:45,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:45,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:45,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:45,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:42" (1/3) ... [2019-10-13 21:24:45,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32badca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:45, skipping insertion in model container [2019-10-13 21:24:45,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:43" (2/3) ... [2019-10-13 21:24:45,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32badca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:45, skipping insertion in model container [2019-10-13 21:24:45,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:45" (3/3) ... [2019-10-13 21:24:45,231 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:45,240 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:45,258 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:24:45,270 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:24:45,298 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:45,298 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:45,299 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:45,299 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:45,299 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:45,299 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:45,300 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:45,300 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states. [2019-10-13 21:24:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:24:45,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:45,338 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] [2019-10-13 21:24:45,340 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:45,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:45,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1942738218, now seen corresponding path program 1 times [2019-10-13 21:24:45,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:45,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907039989] [2019-10-13 21:24:45,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:45,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:45,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:45,913 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-13 21:24:45,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907039989] [2019-10-13 21:24:45,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:45,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:45,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134574060] [2019-10-13 21:24:45,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:45,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:45,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:45,943 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 3 states. [2019-10-13 21:24:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:46,171 INFO L93 Difference]: Finished difference Result 509 states and 869 transitions. [2019-10-13 21:24:46,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:46,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-13 21:24:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:46,200 INFO L225 Difference]: With dead ends: 509 [2019-10-13 21:24:46,200 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 21:24:46,208 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-13 21:24:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 21:24:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2019-10-13 21:24:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-13 21:24:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 566 transitions. [2019-10-13 21:24:46,284 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 566 transitions. Word has length 105 [2019-10-13 21:24:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:46,285 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 566 transitions. [2019-10-13 21:24:46,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 566 transitions. [2019-10-13 21:24:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:24:46,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:46,289 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] [2019-10-13 21:24:46,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:46,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1562873963, now seen corresponding path program 1 times [2019-10-13 21:24:46,290 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:46,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603545001] [2019-10-13 21:24:46,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:46,751 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-13 21:24:46,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603545001] [2019-10-13 21:24:46,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:46,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:46,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020178664] [2019-10-13 21:24:46,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:46,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:46,755 INFO L87 Difference]: Start difference. First operand 373 states and 566 transitions. Second operand 4 states. [2019-10-13 21:24:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:46,909 INFO L93 Difference]: Finished difference Result 1077 states and 1633 transitions. [2019-10-13 21:24:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:46,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 21:24:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:46,915 INFO L225 Difference]: With dead ends: 1077 [2019-10-13 21:24:46,915 INFO L226 Difference]: Without dead ends: 717 [2019-10-13 21:24:46,921 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-13 21:24:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-13 21:24:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2019-10-13 21:24:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-13 21:24:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1076 transitions. [2019-10-13 21:24:46,981 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1076 transitions. Word has length 105 [2019-10-13 21:24:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:46,982 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1076 transitions. [2019-10-13 21:24:46,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1076 transitions. [2019-10-13 21:24:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:24:46,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:46,986 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] [2019-10-13 21:24:46,986 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:46,987 INFO L82 PathProgramCache]: Analyzing trace with hash 878256033, now seen corresponding path program 1 times [2019-10-13 21:24:46,987 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:46,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761021450] [2019-10-13 21:24:46,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:47,052 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-13 21:24:47,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761021450] [2019-10-13 21:24:47,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:47,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:47,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497107143] [2019-10-13 21:24:47,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:47,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:47,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:47,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:47,055 INFO L87 Difference]: Start difference. First operand 715 states and 1076 transitions. Second operand 3 states. [2019-10-13 21:24:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:47,116 INFO L93 Difference]: Finished difference Result 2099 states and 3158 transitions. [2019-10-13 21:24:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:47,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-13 21:24:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:47,124 INFO L225 Difference]: With dead ends: 2099 [2019-10-13 21:24:47,124 INFO L226 Difference]: Without dead ends: 1416 [2019-10-13 21:24:47,126 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-13 21:24:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-10-13 21:24:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 717. [2019-10-13 21:24:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-13 21:24:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1078 transitions. [2019-10-13 21:24:47,170 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1078 transitions. Word has length 106 [2019-10-13 21:24:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:47,170 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1078 transitions. [2019-10-13 21:24:47,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1078 transitions. [2019-10-13 21:24:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:24:47,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:47,173 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] [2019-10-13 21:24:47,173 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1289386322, now seen corresponding path program 1 times [2019-10-13 21:24:47,174 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:47,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008286038] [2019-10-13 21:24:47,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:47,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-13 21:24:47,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008286038] [2019-10-13 21:24:47,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:47,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:47,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760208950] [2019-10-13 21:24:47,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:47,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:47,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:47,254 INFO L87 Difference]: Start difference. First operand 717 states and 1078 transitions. Second operand 3 states. [2019-10-13 21:24:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:47,378 INFO L93 Difference]: Finished difference Result 1629 states and 2536 transitions. [2019-10-13 21:24:47,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:47,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-13 21:24:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:47,387 INFO L225 Difference]: With dead ends: 1629 [2019-10-13 21:24:47,387 INFO L226 Difference]: Without dead ends: 1043 [2019-10-13 21:24:47,390 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-13 21:24:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-13 21:24:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1013. [2019-10-13 21:24:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-10-13 21:24:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1569 transitions. [2019-10-13 21:24:47,462 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1569 transitions. Word has length 107 [2019-10-13 21:24:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:47,463 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 1569 transitions. [2019-10-13 21:24:47,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1569 transitions. [2019-10-13 21:24:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:24:47,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:47,466 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] [2019-10-13 21:24:47,467 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:47,467 INFO L82 PathProgramCache]: Analyzing trace with hash 75181962, now seen corresponding path program 1 times [2019-10-13 21:24:47,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:47,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357227250] [2019-10-13 21:24:47,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:47,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-13 21:24:47,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357227250] [2019-10-13 21:24:47,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:47,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:47,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281345202] [2019-10-13 21:24:47,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:47,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:47,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:47,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:47,657 INFO L87 Difference]: Start difference. First operand 1013 states and 1569 transitions. Second operand 4 states. [2019-10-13 21:24:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:47,812 INFO L93 Difference]: Finished difference Result 2008 states and 3113 transitions. [2019-10-13 21:24:47,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:47,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 21:24:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:47,822 INFO L225 Difference]: With dead ends: 2008 [2019-10-13 21:24:47,822 INFO L226 Difference]: Without dead ends: 1013 [2019-10-13 21:24:47,826 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-13 21:24:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-10-13 21:24:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2019-10-13 21:24:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-10-13 21:24:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1566 transitions. [2019-10-13 21:24:47,920 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1566 transitions. Word has length 107 [2019-10-13 21:24:47,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:47,922 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1566 transitions. [2019-10-13 21:24:47,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1566 transitions. [2019-10-13 21:24:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:24:47,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:47,924 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] [2019-10-13 21:24:47,924 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash -610700672, now seen corresponding path program 1 times [2019-10-13 21:24:47,925 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:47,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821152797] [2019-10-13 21:24:47,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:47,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:48,136 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-13 21:24:48,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821152797] [2019-10-13 21:24:48,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:48,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:48,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368188231] [2019-10-13 21:24:48,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:48,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:48,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:48,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:48,141 INFO L87 Difference]: Start difference. First operand 1012 states and 1566 transitions. Second operand 3 states. [2019-10-13 21:24:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:48,267 INFO L93 Difference]: Finished difference Result 2765 states and 4312 transitions. [2019-10-13 21:24:48,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:48,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-13 21:24:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:48,283 INFO L225 Difference]: With dead ends: 2765 [2019-10-13 21:24:48,283 INFO L226 Difference]: Without dead ends: 1949 [2019-10-13 21:24:48,286 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-13 21:24:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-10-13 21:24:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1947. [2019-10-13 21:24:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-10-13 21:24:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2988 transitions. [2019-10-13 21:24:48,424 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2988 transitions. Word has length 107 [2019-10-13 21:24:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:48,425 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 2988 transitions. [2019-10-13 21:24:48,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2988 transitions. [2019-10-13 21:24:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:24:48,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:48,428 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] [2019-10-13 21:24:48,428 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash 935860675, now seen corresponding path program 1 times [2019-10-13 21:24:48,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:48,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47550117] [2019-10-13 21:24:48,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:48,596 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-13 21:24:48,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47550117] [2019-10-13 21:24:48,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:48,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:48,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363820464] [2019-10-13 21:24:48,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:48,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:48,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:48,598 INFO L87 Difference]: Start difference. First operand 1947 states and 2988 transitions. Second operand 4 states. [2019-10-13 21:24:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:48,716 INFO L93 Difference]: Finished difference Result 3252 states and 5019 transitions. [2019-10-13 21:24:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:48,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 21:24:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:48,725 INFO L225 Difference]: With dead ends: 3252 [2019-10-13 21:24:48,725 INFO L226 Difference]: Without dead ends: 1489 [2019-10-13 21:24:48,731 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-13 21:24:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2019-10-13 21:24:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1489. [2019-10-13 21:24:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2019-10-13 21:24:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2274 transitions. [2019-10-13 21:24:48,869 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2274 transitions. Word has length 107 [2019-10-13 21:24:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:48,870 INFO L462 AbstractCegarLoop]: Abstraction has 1489 states and 2274 transitions. [2019-10-13 21:24:48,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2274 transitions. [2019-10-13 21:24:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:24:48,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:48,872 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] [2019-10-13 21:24:48,873 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:48,873 INFO L82 PathProgramCache]: Analyzing trace with hash -967455086, now seen corresponding path program 1 times [2019-10-13 21:24:48,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:48,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299025174] [2019-10-13 21:24:48,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:48,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-13 21:24:48,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299025174] [2019-10-13 21:24:48,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:48,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:48,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868015806] [2019-10-13 21:24:48,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:48,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:48,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:48,962 INFO L87 Difference]: Start difference. First operand 1489 states and 2274 transitions. Second operand 3 states. [2019-10-13 21:24:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:49,130 INFO L93 Difference]: Finished difference Result 3562 states and 5609 transitions. [2019-10-13 21:24:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:49,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-13 21:24:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,146 INFO L225 Difference]: With dead ends: 3562 [2019-10-13 21:24:49,146 INFO L226 Difference]: Without dead ends: 2343 [2019-10-13 21:24:49,151 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-13 21:24:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-10-13 21:24:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2257. [2019-10-13 21:24:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-10-13 21:24:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3522 transitions. [2019-10-13 21:24:49,336 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3522 transitions. Word has length 109 [2019-10-13 21:24:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,337 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 3522 transitions. [2019-10-13 21:24:49,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3522 transitions. [2019-10-13 21:24:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:24:49,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,339 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] [2019-10-13 21:24:49,340 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash 195490705, now seen corresponding path program 1 times [2019-10-13 21:24:49,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605754547] [2019-10-13 21:24:49,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,623 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-13 21:24:49,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605754547] [2019-10-13 21:24:49,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:49,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651569989] [2019-10-13 21:24:49,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:49,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:49,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:49,627 INFO L87 Difference]: Start difference. First operand 2257 states and 3522 transitions. Second operand 4 states. [2019-10-13 21:24:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:49,889 INFO L93 Difference]: Finished difference Result 5820 states and 9101 transitions. [2019-10-13 21:24:49,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:49,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-13 21:24:49,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,909 INFO L225 Difference]: With dead ends: 5820 [2019-10-13 21:24:49,909 INFO L226 Difference]: Without dead ends: 3594 [2019-10-13 21:24:49,917 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-13 21:24:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-10-13 21:24:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2019-10-13 21:24:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-10-13 21:24:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5576 transitions. [2019-10-13 21:24:50,162 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5576 transitions. Word has length 110 [2019-10-13 21:24:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,165 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5576 transitions. [2019-10-13 21:24:50,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5576 transitions. [2019-10-13 21:24:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:24:50,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,168 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] [2019-10-13 21:24:50,169 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2099167218, now seen corresponding path program 1 times [2019-10-13 21:24:50,170 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551191267] [2019-10-13 21:24:50,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,308 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-13 21:24:50,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551191267] [2019-10-13 21:24:50,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:50,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481700468] [2019-10-13 21:24:50,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:50,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:50,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:50,310 INFO L87 Difference]: Start difference. First operand 3592 states and 5576 transitions. Second operand 3 states. [2019-10-13 21:24:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,631 INFO L93 Difference]: Finished difference Result 8748 states and 13683 transitions. [2019-10-13 21:24:50,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:50,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-13 21:24:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,658 INFO L225 Difference]: With dead ends: 8748 [2019-10-13 21:24:50,659 INFO L226 Difference]: Without dead ends: 5532 [2019-10-13 21:24:50,671 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-13 21:24:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-10-13 21:24:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5530. [2019-10-13 21:24:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5530 states. [2019-10-13 21:24:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 8515 transitions. [2019-10-13 21:24:51,069 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 8515 transitions. Word has length 112 [2019-10-13 21:24:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,069 INFO L462 AbstractCegarLoop]: Abstraction has 5530 states and 8515 transitions. [2019-10-13 21:24:51,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 8515 transitions. [2019-10-13 21:24:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:24:51,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,074 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] [2019-10-13 21:24:51,074 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash -122679506, now seen corresponding path program 1 times [2019-10-13 21:24:51,075 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368139283] [2019-10-13 21:24:51,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,148 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-13 21:24:51,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368139283] [2019-10-13 21:24:51,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:51,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384446069] [2019-10-13 21:24:51,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:51,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:51,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:51,150 INFO L87 Difference]: Start difference. First operand 5530 states and 8515 transitions. Second operand 3 states. [2019-10-13 21:24:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,701 INFO L93 Difference]: Finished difference Result 14570 states and 22850 transitions. [2019-10-13 21:24:51,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:51,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-13 21:24:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,741 INFO L225 Difference]: With dead ends: 14570 [2019-10-13 21:24:51,741 INFO L226 Difference]: Without dead ends: 9376 [2019-10-13 21:24:51,751 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-13 21:24:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2019-10-13 21:24:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 8966. [2019-10-13 21:24:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-10-13 21:24:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 14034 transitions. [2019-10-13 21:24:52,382 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 14034 transitions. Word has length 114 [2019-10-13 21:24:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:52,382 INFO L462 AbstractCegarLoop]: Abstraction has 8966 states and 14034 transitions. [2019-10-13 21:24:52,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 14034 transitions. [2019-10-13 21:24:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:24:52,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:52,387 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] [2019-10-13 21:24:52,387 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1346619386, now seen corresponding path program 1 times [2019-10-13 21:24:52,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:52,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509091281] [2019-10-13 21:24:52,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:52,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:52,478 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-13 21:24:52,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509091281] [2019-10-13 21:24:52,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:52,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:52,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721513609] [2019-10-13 21:24:52,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:52,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:52,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:52,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:52,481 INFO L87 Difference]: Start difference. First operand 8966 states and 14034 transitions. Second operand 3 states. [2019-10-13 21:24:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:53,587 INFO L93 Difference]: Finished difference Result 25623 states and 40462 transitions. [2019-10-13 21:24:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:53,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-13 21:24:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:53,634 INFO L225 Difference]: With dead ends: 25623 [2019-10-13 21:24:53,634 INFO L226 Difference]: Without dead ends: 17325 [2019-10-13 21:24:53,651 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-13 21:24:53,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17325 states. [2019-10-13 21:24:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17325 to 17323. [2019-10-13 21:24:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-10-13 21:24:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 27148 transitions. [2019-10-13 21:24:54,666 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 27148 transitions. Word has length 115 [2019-10-13 21:24:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:54,666 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 27148 transitions. [2019-10-13 21:24:54,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 27148 transitions. [2019-10-13 21:24:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:24:54,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:54,671 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] [2019-10-13 21:24:54,671 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash 636430229, now seen corresponding path program 1 times [2019-10-13 21:24:54,672 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:54,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466475182] [2019-10-13 21:24:54,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:54,817 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-13 21:24:54,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466475182] [2019-10-13 21:24:54,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:54,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:54,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005658949] [2019-10-13 21:24:54,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:54,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:54,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:54,820 INFO L87 Difference]: Start difference. First operand 17323 states and 27148 transitions. Second operand 4 states. [2019-10-13 21:24:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:56,745 INFO L93 Difference]: Finished difference Result 48390 states and 75721 transitions. [2019-10-13 21:24:56,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:56,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-13 21:24:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:56,843 INFO L225 Difference]: With dead ends: 48390 [2019-10-13 21:24:56,843 INFO L226 Difference]: Without dead ends: 31110 [2019-10-13 21:24:56,882 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-13 21:24:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31110 states. [2019-10-13 21:24:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31110 to 31108. [2019-10-13 21:24:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31108 states. [2019-10-13 21:24:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31108 states to 31108 states and 48219 transitions. [2019-10-13 21:24:58,584 INFO L78 Accepts]: Start accepts. Automaton has 31108 states and 48219 transitions. Word has length 115 [2019-10-13 21:24:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:58,585 INFO L462 AbstractCegarLoop]: Abstraction has 31108 states and 48219 transitions. [2019-10-13 21:24:58,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 31108 states and 48219 transitions. [2019-10-13 21:24:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:24:58,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:58,593 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] [2019-10-13 21:24:58,593 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:58,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2111377993, now seen corresponding path program 1 times [2019-10-13 21:24:58,594 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:58,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538025944] [2019-10-13 21:24:58,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:58,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:58,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:58,643 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-13 21:24:58,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538025944] [2019-10-13 21:24:58,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:58,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:58,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842685440] [2019-10-13 21:24:58,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:58,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:58,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:58,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:58,646 INFO L87 Difference]: Start difference. First operand 31108 states and 48219 transitions. Second operand 3 states. [2019-10-13 21:25:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:01,405 INFO L93 Difference]: Finished difference Result 93118 states and 144394 transitions. [2019-10-13 21:25:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:01,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-13 21:25:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:01,592 INFO L225 Difference]: With dead ends: 93118 [2019-10-13 21:25:01,593 INFO L226 Difference]: Without dead ends: 62122 [2019-10-13 21:25:01,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-13 21:25:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62122 states. [2019-10-13 21:25:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62122 to 31114. [2019-10-13 21:25:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31114 states. [2019-10-13 21:25:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31114 states to 31114 states and 48225 transitions. [2019-10-13 21:25:03,573 INFO L78 Accepts]: Start accepts. Automaton has 31114 states and 48225 transitions. Word has length 116 [2019-10-13 21:25:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:03,574 INFO L462 AbstractCegarLoop]: Abstraction has 31114 states and 48225 transitions. [2019-10-13 21:25:03,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 31114 states and 48225 transitions. [2019-10-13 21:25:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:25:03,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:03,581 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] [2019-10-13 21:25:03,581 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:03,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2029851444, now seen corresponding path program 1 times [2019-10-13 21:25:03,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:03,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471489443] [2019-10-13 21:25:03,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:03,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:03,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:03,729 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-13 21:25:03,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471489443] [2019-10-13 21:25:03,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:03,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:03,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438648146] [2019-10-13 21:25:03,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:03,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:03,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:03,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:03,732 INFO L87 Difference]: Start difference. First operand 31114 states and 48225 transitions. Second operand 4 states. [2019-10-13 21:25:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:05,000 INFO L93 Difference]: Finished difference Result 62114 states and 96305 transitions. [2019-10-13 21:25:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:05,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-10-13 21:25:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:05,045 INFO L225 Difference]: With dead ends: 62114 [2019-10-13 21:25:05,045 INFO L226 Difference]: Without dead ends: 31114 [2019-10-13 21:25:05,087 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-13 21:25:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31114 states. [2019-10-13 21:25:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31114 to 31111. [2019-10-13 21:25:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31111 states. [2019-10-13 21:25:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31111 states to 31111 states and 48218 transitions. [2019-10-13 21:25:06,517 INFO L78 Accepts]: Start accepts. Automaton has 31111 states and 48218 transitions. Word has length 117 [2019-10-13 21:25:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:06,517 INFO L462 AbstractCegarLoop]: Abstraction has 31111 states and 48218 transitions. [2019-10-13 21:25:06,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 31111 states and 48218 transitions. [2019-10-13 21:25:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:25:06,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:06,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] [2019-10-13 21:25:06,526 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash 32262, now seen corresponding path program 1 times [2019-10-13 21:25:06,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:06,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54339957] [2019-10-13 21:25:06,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:06,617 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-13 21:25:06,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54339957] [2019-10-13 21:25:06,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:06,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:06,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97147076] [2019-10-13 21:25:06,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:06,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:06,619 INFO L87 Difference]: Start difference. First operand 31111 states and 48218 transitions. Second operand 3 states. [2019-10-13 21:25:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:09,183 INFO L93 Difference]: Finished difference Result 80969 states and 125370 transitions. [2019-10-13 21:25:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:09,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-13 21:25:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:09,241 INFO L225 Difference]: With dead ends: 80969 [2019-10-13 21:25:09,242 INFO L226 Difference]: Without dead ends: 50895 [2019-10-13 21:25:09,271 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-13 21:25:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50895 states. [2019-10-13 21:25:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50895 to 50893. [2019-10-13 21:25:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50893 states. [2019-10-13 21:25:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50893 states to 50893 states and 77668 transitions. [2019-10-13 21:25:11,487 INFO L78 Accepts]: Start accepts. Automaton has 50893 states and 77668 transitions. Word has length 117 [2019-10-13 21:25:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:11,487 INFO L462 AbstractCegarLoop]: Abstraction has 50893 states and 77668 transitions. [2019-10-13 21:25:11,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:11,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50893 states and 77668 transitions. [2019-10-13 21:25:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:25:11,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:11,498 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] [2019-10-13 21:25:11,498 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash 177694473, now seen corresponding path program 1 times [2019-10-13 21:25:11,499 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:11,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659807722] [2019-10-13 21:25:11,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:11,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:11,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:11,608 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-13 21:25:11,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659807722] [2019-10-13 21:25:11,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:11,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:11,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451035013] [2019-10-13 21:25:11,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:11,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:11,610 INFO L87 Difference]: Start difference. First operand 50893 states and 77668 transitions. Second operand 4 states. [2019-10-13 21:25:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:13,584 INFO L93 Difference]: Finished difference Result 94925 states and 145243 transitions. [2019-10-13 21:25:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:13,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-10-13 21:25:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:13,637 INFO L225 Difference]: With dead ends: 94925 [2019-10-13 21:25:13,637 INFO L226 Difference]: Without dead ends: 44923 [2019-10-13 21:25:13,677 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-13 21:25:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44923 states. [2019-10-13 21:25:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44923 to 44923. [2019-10-13 21:25:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44923 states. [2019-10-13 21:25:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44923 states to 44923 states and 68620 transitions. [2019-10-13 21:25:17,027 INFO L78 Accepts]: Start accepts. Automaton has 44923 states and 68620 transitions. Word has length 117 [2019-10-13 21:25:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:17,027 INFO L462 AbstractCegarLoop]: Abstraction has 44923 states and 68620 transitions. [2019-10-13 21:25:17,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 44923 states and 68620 transitions. [2019-10-13 21:25:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:25:17,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:17,033 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] [2019-10-13 21:25:17,033 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1933167575, now seen corresponding path program 1 times [2019-10-13 21:25:17,034 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:17,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387577360] [2019-10-13 21:25:17,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:17,181 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-13 21:25:17,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387577360] [2019-10-13 21:25:17,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:17,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:17,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652194112] [2019-10-13 21:25:17,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:17,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:17,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:17,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:17,183 INFO L87 Difference]: Start difference. First operand 44923 states and 68620 transitions. Second operand 4 states.