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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:49,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:49,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:49,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:49,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:49,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:49,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:49,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:49,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:49,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:49,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:49,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:49,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:49,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:49,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:49,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:49,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:49,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:49,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:49,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:49,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:49,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:49,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:49,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:49,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:49,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:49,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:49,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:49,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:49,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:49,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:49,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:49,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:49,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:49,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:49,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:49,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:49,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:49,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:49,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:49,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:49,860 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:49,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:49,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:49,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:49,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:49,875 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:49,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:49,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:49,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:49,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:49,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:49,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:49,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:49,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:49,877 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:49,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:49,877 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:49,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:49,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:49,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:49,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:49,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:49,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:49,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:49,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:49,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:49,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:49,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:49,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:49,880 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:50,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:50,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:50,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:50,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:50,215 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:50,215 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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:50,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3595b30a1/0d4d1e230fa94b458960668471bff133/FLAGa2f733a1e [2019-10-13 21:24:50,793 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:50,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:50,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3595b30a1/0d4d1e230fa94b458960668471bff133/FLAGa2f733a1e [2019-10-13 21:24:51,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3595b30a1/0d4d1e230fa94b458960668471bff133 [2019-10-13 21:24:51,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:51,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:51,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:51,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:51,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:51,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:51" (1/1) ... [2019-10-13 21:24:51,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb7e4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:51, skipping insertion in model container [2019-10-13 21:24:51,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:51" (1/1) ... [2019-10-13 21:24:51,082 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:51,159 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:51,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:51,773 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:51,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:51,966 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:51,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:51 WrapperNode [2019-10-13 21:24:51,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:51,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:51,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:51,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:51,978 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:51" (1/1) ... [2019-10-13 21:24:51,978 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:51" (1/1) ... [2019-10-13 21:24:51,993 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:51" (1/1) ... [2019-10-13 21:24:51,993 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:51" (1/1) ... [2019-10-13 21:24:52,020 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:51" (1/1) ... [2019-10-13 21:24:52,042 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:51" (1/1) ... [2019-10-13 21:24:52,047 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:51" (1/1) ... [2019-10-13 21:24:52,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:52,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:52,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:52,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:52,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:51" (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:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:52,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:52,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:53,653 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:53,653 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:53,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:53 BoogieIcfgContainer [2019-10-13 21:24:53,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:53,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:53,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:53,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:53,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:51" (1/3) ... [2019-10-13 21:24:53,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f78ba5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:53, skipping insertion in model container [2019-10-13 21:24:53,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:51" (2/3) ... [2019-10-13 21:24:53,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f78ba5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:53, skipping insertion in model container [2019-10-13 21:24:53,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:53" (3/3) ... [2019-10-13 21:24:53,663 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 21:24:53,672 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:53,680 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:24:53,692 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:24:53,720 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:53,721 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:53,721 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:53,721 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:53,721 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:53,721 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:53,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:53,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-10-13 21:24:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:53,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:53,765 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:53,767 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:53,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:53,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1155837260, now seen corresponding path program 1 times [2019-10-13 21:24:53,782 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:53,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239441522] [2019-10-13 21:24:53,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:54,426 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,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239441522] [2019-10-13 21:24:54,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:54,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:54,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100884485] [2019-10-13 21:24:54,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:54,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:54,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:54,455 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-10-13 21:24:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,668 INFO L93 Difference]: Finished difference Result 647 states and 1119 transitions. [2019-10-13 21:24:54,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:54,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-13 21:24:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,695 INFO L225 Difference]: With dead ends: 647 [2019-10-13 21:24:54,695 INFO L226 Difference]: Without dead ends: 527 [2019-10-13 21:24:54,702 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:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-13 21:24:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2019-10-13 21:24:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-10-13 21:24:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 780 transitions. [2019-10-13 21:24:54,854 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 780 transitions. Word has length 156 [2019-10-13 21:24:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:54,858 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 780 transitions. [2019-10-13 21:24:54,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 780 transitions. [2019-10-13 21:24:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:54,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:54,871 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:54,872 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:54,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1353690447, now seen corresponding path program 1 times [2019-10-13 21:24:54,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:54,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628863814] [2019-10-13 21:24:54,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:54,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,364 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:55,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628863814] [2019-10-13 21:24:55,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:55,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53346050] [2019-10-13 21:24:55,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:55,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:55,368 INFO L87 Difference]: Start difference. First operand 525 states and 780 transitions. Second operand 4 states. [2019-10-13 21:24:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:55,509 INFO L93 Difference]: Finished difference Result 1532 states and 2273 transitions. [2019-10-13 21:24:55,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:55,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-13 21:24:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:55,517 INFO L225 Difference]: With dead ends: 1532 [2019-10-13 21:24:55,517 INFO L226 Difference]: Without dead ends: 1020 [2019-10-13 21:24:55,525 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:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-10-13 21:24:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1018. [2019-10-13 21:24:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-10-13 21:24:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1501 transitions. [2019-10-13 21:24:55,631 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1501 transitions. Word has length 156 [2019-10-13 21:24:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:55,633 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 1501 transitions. [2019-10-13 21:24:55,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1501 transitions. [2019-10-13 21:24:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:24:55,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:55,642 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:55,642 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:55,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1552789903, now seen corresponding path program 1 times [2019-10-13 21:24:55,643 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:55,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630439358] [2019-10-13 21:24:55,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,746 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:55,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630439358] [2019-10-13 21:24:55,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:55,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356447097] [2019-10-13 21:24:55,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:55,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:55,754 INFO L87 Difference]: Start difference. First operand 1018 states and 1501 transitions. Second operand 3 states. [2019-10-13 21:24:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:55,874 INFO L93 Difference]: Finished difference Result 3008 states and 4433 transitions. [2019-10-13 21:24:55,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:55,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-13 21:24:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:55,892 INFO L225 Difference]: With dead ends: 3008 [2019-10-13 21:24:55,892 INFO L226 Difference]: Without dead ends: 2022 [2019-10-13 21:24:55,896 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:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-10-13 21:24:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1020. [2019-10-13 21:24:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-13 21:24:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1503 transitions. [2019-10-13 21:24:55,997 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1503 transitions. Word has length 157 [2019-10-13 21:24:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:55,997 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1503 transitions. [2019-10-13 21:24:55,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1503 transitions. [2019-10-13 21:24:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:24:56,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:56,001 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:56,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1516867775, now seen corresponding path program 1 times [2019-10-13 21:24:56,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:56,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831552876] [2019-10-13 21:24:56,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:56,238 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:56,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831552876] [2019-10-13 21:24:56,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:56,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:56,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528836904] [2019-10-13 21:24:56,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:56,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:56,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:56,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:56,241 INFO L87 Difference]: Start difference. First operand 1020 states and 1503 transitions. Second operand 3 states. [2019-10-13 21:24:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:56,377 INFO L93 Difference]: Finished difference Result 2789 states and 4120 transitions. [2019-10-13 21:24:56,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:56,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-13 21:24:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:56,388 INFO L225 Difference]: With dead ends: 2789 [2019-10-13 21:24:56,388 INFO L226 Difference]: Without dead ends: 1966 [2019-10-13 21:24:56,391 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:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-10-13 21:24:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1964. [2019-10-13 21:24:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-10-13 21:24:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2867 transitions. [2019-10-13 21:24:56,496 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2867 transitions. Word has length 158 [2019-10-13 21:24:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:56,497 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 2867 transitions. [2019-10-13 21:24:56,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2867 transitions. [2019-10-13 21:24:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:24:56,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:56,501 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:56,502 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2015367012, now seen corresponding path program 1 times [2019-10-13 21:24:56,502 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:56,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873607124] [2019-10-13 21:24:56,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:56,657 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:56,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873607124] [2019-10-13 21:24:56,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:56,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:56,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059922632] [2019-10-13 21:24:56,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:56,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:56,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:56,659 INFO L87 Difference]: Start difference. First operand 1964 states and 2867 transitions. Second operand 4 states. [2019-10-13 21:24:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:56,768 INFO L93 Difference]: Finished difference Result 3278 states and 4800 transitions. [2019-10-13 21:24:56,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:56,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-13 21:24:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:56,776 INFO L225 Difference]: With dead ends: 3278 [2019-10-13 21:24:56,777 INFO L226 Difference]: Without dead ends: 1499 [2019-10-13 21:24:56,781 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:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-10-13 21:24:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2019-10-13 21:24:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-10-13 21:24:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2182 transitions. [2019-10-13 21:24:56,901 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2182 transitions. Word has length 158 [2019-10-13 21:24:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:56,901 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 2182 transitions. [2019-10-13 21:24:56,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2182 transitions. [2019-10-13 21:24:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:24:56,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:56,905 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:56,906 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:56,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash -528962491, now seen corresponding path program 1 times [2019-10-13 21:24:56,906 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:56,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160875721] [2019-10-13 21:24:56,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:56,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:57,005 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:57,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160875721] [2019-10-13 21:24:57,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:57,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:57,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927238267] [2019-10-13 21:24:57,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:57,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:57,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:57,008 INFO L87 Difference]: Start difference. First operand 1499 states and 2182 transitions. Second operand 3 states. [2019-10-13 21:24:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:57,159 INFO L93 Difference]: Finished difference Result 3290 states and 4921 transitions. [2019-10-13 21:24:57,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:57,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-13 21:24:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:57,178 INFO L225 Difference]: With dead ends: 3290 [2019-10-13 21:24:57,178 INFO L226 Difference]: Without dead ends: 1977 [2019-10-13 21:24:57,183 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:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-10-13 21:24:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1933. [2019-10-13 21:24:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1933 states. [2019-10-13 21:24:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2888 transitions. [2019-10-13 21:24:57,331 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2888 transitions. Word has length 159 [2019-10-13 21:24:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:57,331 INFO L462 AbstractCegarLoop]: Abstraction has 1933 states and 2888 transitions. [2019-10-13 21:24:57,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2888 transitions. [2019-10-13 21:24:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:24:57,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:57,336 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:57,336 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:57,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1484207381, now seen corresponding path program 1 times [2019-10-13 21:24:57,337 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:57,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716978606] [2019-10-13 21:24:57,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:57,465 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:57,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716978606] [2019-10-13 21:24:57,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:57,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:57,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443960425] [2019-10-13 21:24:57,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:57,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:57,467 INFO L87 Difference]: Start difference. First operand 1933 states and 2888 transitions. Second operand 3 states. [2019-10-13 21:24:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:57,696 INFO L93 Difference]: Finished difference Result 4690 states and 7155 transitions. [2019-10-13 21:24:57,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:57,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-13 21:24:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:57,712 INFO L225 Difference]: With dead ends: 4690 [2019-10-13 21:24:57,713 INFO L226 Difference]: Without dead ends: 3027 [2019-10-13 21:24:57,717 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:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2019-10-13 21:24:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 2711. [2019-10-13 21:24:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2019-10-13 21:24:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4151 transitions. [2019-10-13 21:24:57,883 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4151 transitions. Word has length 162 [2019-10-13 21:24:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:57,884 INFO L462 AbstractCegarLoop]: Abstraction has 2711 states and 4151 transitions. [2019-10-13 21:24:57,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4151 transitions. [2019-10-13 21:24:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:24:57,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:57,888 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:24:57,888 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2071220188, now seen corresponding path program 1 times [2019-10-13 21:24:57,889 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:57,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22991683] [2019-10-13 21:24:57,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:58,213 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,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22991683] [2019-10-13 21:24:58,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:58,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:58,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127894749] [2019-10-13 21:24:58,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:58,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:58,216 INFO L87 Difference]: Start difference. First operand 2711 states and 4151 transitions. Second operand 9 states. [2019-10-13 21:24:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:59,536 INFO L93 Difference]: Finished difference Result 9554 states and 14922 transitions. [2019-10-13 21:24:59,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:24:59,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-10-13 21:24:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:59,584 INFO L225 Difference]: With dead ends: 9554 [2019-10-13 21:24:59,585 INFO L226 Difference]: Without dead ends: 7023 [2019-10-13 21:24:59,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:24:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2019-10-13 21:25:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 5089. [2019-10-13 21:25:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5089 states. [2019-10-13 21:25:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5089 states to 5089 states and 7829 transitions. [2019-10-13 21:25:00,221 INFO L78 Accepts]: Start accepts. Automaton has 5089 states and 7829 transitions. Word has length 162 [2019-10-13 21:25:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:00,222 INFO L462 AbstractCegarLoop]: Abstraction has 5089 states and 7829 transitions. [2019-10-13 21:25:00,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5089 states and 7829 transitions. [2019-10-13 21:25:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:25:00,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:00,234 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:00,234 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash 430958199, now seen corresponding path program 1 times [2019-10-13 21:25:00,235 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:00,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961193589] [2019-10-13 21:25:00,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:00,499 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:00,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961193589] [2019-10-13 21:25:00,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:00,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:00,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30174661] [2019-10-13 21:25:00,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:00,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:00,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:00,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:00,503 INFO L87 Difference]: Start difference. First operand 5089 states and 7829 transitions. Second operand 4 states. [2019-10-13 21:25:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:01,321 INFO L93 Difference]: Finished difference Result 13547 states and 21235 transitions. [2019-10-13 21:25:01,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:01,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-13 21:25:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:01,386 INFO L225 Difference]: With dead ends: 13547 [2019-10-13 21:25:01,386 INFO L226 Difference]: Without dead ends: 9797 [2019-10-13 21:25:01,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9797 states. [2019-10-13 21:25:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9797 to 9795. [2019-10-13 21:25:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9795 states. [2019-10-13 21:25:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 15103 transitions. [2019-10-13 21:25:02,129 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 15103 transitions. Word has length 162 [2019-10-13 21:25:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:02,130 INFO L462 AbstractCegarLoop]: Abstraction has 9795 states and 15103 transitions. [2019-10-13 21:25:02,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 15103 transitions. [2019-10-13 21:25:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:25:02,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:02,139 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:02,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:02,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 169281566, now seen corresponding path program 1 times [2019-10-13 21:25:02,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:02,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548304258] [2019-10-13 21:25:02,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:02,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:02,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:02,396 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:02,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548304258] [2019-10-13 21:25:02,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:02,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:02,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120384341] [2019-10-13 21:25:02,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:02,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:02,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:02,400 INFO L87 Difference]: Start difference. First operand 9795 states and 15103 transitions. Second operand 4 states. [2019-10-13 21:25:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:03,339 INFO L93 Difference]: Finished difference Result 25746 states and 39693 transitions. [2019-10-13 21:25:03,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:03,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-13 21:25:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:03,376 INFO L225 Difference]: With dead ends: 25746 [2019-10-13 21:25:03,376 INFO L226 Difference]: Without dead ends: 15974 [2019-10-13 21:25:03,401 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:25:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15974 states. [2019-10-13 21:25:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15974 to 15972. [2019-10-13 21:25:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15972 states. [2019-10-13 21:25:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15972 states to 15972 states and 24436 transitions. [2019-10-13 21:25:04,530 INFO L78 Accepts]: Start accepts. Automaton has 15972 states and 24436 transitions. Word has length 162 [2019-10-13 21:25:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:04,530 INFO L462 AbstractCegarLoop]: Abstraction has 15972 states and 24436 transitions. [2019-10-13 21:25:04,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 15972 states and 24436 transitions. [2019-10-13 21:25:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:25:04,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,542 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:04,543 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1075293888, now seen corresponding path program 1 times [2019-10-13 21:25:04,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400488218] [2019-10-13 21:25:04,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,656 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:04,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400488218] [2019-10-13 21:25:04,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:04,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352997434] [2019-10-13 21:25:04,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:04,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:04,658 INFO L87 Difference]: Start difference. First operand 15972 states and 24436 transitions. Second operand 3 states. [2019-10-13 21:25:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:06,422 INFO L93 Difference]: Finished difference Result 43438 states and 66412 transitions. [2019-10-13 21:25:06,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:06,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-13 21:25:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:06,484 INFO L225 Difference]: With dead ends: 43438 [2019-10-13 21:25:06,484 INFO L226 Difference]: Without dead ends: 27862 [2019-10-13 21:25:06,517 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:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27862 states. [2019-10-13 21:25:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27862 to 27860. [2019-10-13 21:25:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27860 states. [2019-10-13 21:25:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27860 states to 27860 states and 42130 transitions. [2019-10-13 21:25:07,861 INFO L78 Accepts]: Start accepts. Automaton has 27860 states and 42130 transitions. Word has length 164 [2019-10-13 21:25:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:07,862 INFO L462 AbstractCegarLoop]: Abstraction has 27860 states and 42130 transitions. [2019-10-13 21:25:07,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 27860 states and 42130 transitions. [2019-10-13 21:25:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:25:07,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:07,880 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:07,880 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1992197475, now seen corresponding path program 1 times [2019-10-13 21:25:07,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:07,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258389135] [2019-10-13 21:25:07,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:07,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:07,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:08,018 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:08,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258389135] [2019-10-13 21:25:08,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:08,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:08,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834640700] [2019-10-13 21:25:08,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:08,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:08,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:08,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:08,021 INFO L87 Difference]: Start difference. First operand 27860 states and 42130 transitions. Second operand 4 states. [2019-10-13 21:25:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:09,341 INFO L93 Difference]: Finished difference Result 46369 states and 70138 transitions. [2019-10-13 21:25:09,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:09,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-13 21:25:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:09,386 INFO L225 Difference]: With dead ends: 46369 [2019-10-13 21:25:09,387 INFO L226 Difference]: Without dead ends: 24890 [2019-10-13 21:25:09,429 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:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24890 states. [2019-10-13 21:25:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24890 to 24890. [2019-10-13 21:25:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24890 states. [2019-10-13 21:25:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24890 states to 24890 states and 37611 transitions. [2019-10-13 21:25:10,597 INFO L78 Accepts]: Start accepts. Automaton has 24890 states and 37611 transitions. Word has length 164 [2019-10-13 21:25:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:10,597 INFO L462 AbstractCegarLoop]: Abstraction has 24890 states and 37611 transitions. [2019-10-13 21:25:10,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 24890 states and 37611 transitions. [2019-10-13 21:25:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 21:25:10,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:10,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:10,614 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash 914961264, now seen corresponding path program 1 times [2019-10-13 21:25:10,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:10,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157348396] [2019-10-13 21:25:10,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:10,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:10,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:10,701 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:10,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157348396] [2019-10-13 21:25:10,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:10,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:10,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243876232] [2019-10-13 21:25:10,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:10,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:10,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:10,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:10,704 INFO L87 Difference]: Start difference. First operand 24890 states and 37611 transitions. Second operand 3 states. [2019-10-13 21:25:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:12,761 INFO L93 Difference]: Finished difference Result 67686 states and 103354 transitions. [2019-10-13 21:25:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:12,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-13 21:25:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:12,835 INFO L225 Difference]: With dead ends: 67686 [2019-10-13 21:25:12,836 INFO L226 Difference]: Without dead ends: 43132 [2019-10-13 21:25:12,875 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:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43132 states. [2019-10-13 21:25:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43132 to 38738. [2019-10-13 21:25:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-10-13 21:25:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 59682 transitions. [2019-10-13 21:25:14,600 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 59682 transitions. Word has length 168 [2019-10-13 21:25:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:14,600 INFO L462 AbstractCegarLoop]: Abstraction has 38738 states and 59682 transitions. [2019-10-13 21:25:14,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 59682 transitions. [2019-10-13 21:25:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 21:25:14,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:14,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:14,614 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:14,614 INFO L82 PathProgramCache]: Analyzing trace with hash -808861162, now seen corresponding path program 1 times [2019-10-13 21:25:14,615 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:14,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783051850] [2019-10-13 21:25:14,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:14,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:14,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:14,811 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:14,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783051850] [2019-10-13 21:25:14,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:14,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:14,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171198690] [2019-10-13 21:25:14,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:14,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:14,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:14,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:14,813 INFO L87 Difference]: Start difference. First operand 38738 states and 59682 transitions. Second operand 9 states. [2019-10-13 21:25:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:22,479 INFO L93 Difference]: Finished difference Result 185670 states and 287874 transitions. [2019-10-13 21:25:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:25:22,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-10-13 21:25:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:22,713 INFO L225 Difference]: With dead ends: 185670 [2019-10-13 21:25:22,713 INFO L226 Difference]: Without dead ends: 147342 [2019-10-13 21:25:22,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:25:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147342 states.