java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:34,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:34,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:35,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:35,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:35,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:35,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:35,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:35,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:35,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:35,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:35,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:35,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:35,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:35,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:35,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:35,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:35,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:35,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:35,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:35,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:35,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:35,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:35,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:35,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:35,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:35,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:35,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:35,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:35,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:35,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:35,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:35,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:35,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:35,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:35,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:35,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:35,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:35,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:35,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:35,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:35,076 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:23:35,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:35,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:35,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:35,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:35,096 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:35,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:35,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:35,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:35,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:35,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:35,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:35,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:35,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:35,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:35,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:35,100 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:35,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:35,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:35,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:35,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:35,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:35,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:35,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:35,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:35,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:35,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:35,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:35,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:35,102 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:23:35,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:35,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:35,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:35,410 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:35,411 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:35,411 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:23:35,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc26fe9b/ff4821cc321b45bebc60a2e701ce92b9/FLAG6717f3a91 [2019-10-13 21:23:36,073 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:36,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:23:36,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc26fe9b/ff4821cc321b45bebc60a2e701ce92b9/FLAG6717f3a91 [2019-10-13 21:23:36,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc26fe9b/ff4821cc321b45bebc60a2e701ce92b9 [2019-10-13 21:23:36,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:36,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:36,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:36,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:36,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:36,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1118f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:36, skipping insertion in model container [2019-10-13 21:23:36,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:36" (1/1) ... [2019-10-13 21:23:36,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:36,407 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:37,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:37,069 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:37,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:37,539 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:37,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37 WrapperNode [2019-10-13 21:23:37,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:37,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:37,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:37,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:37,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (1/1) ... [2019-10-13 21:23:37,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:37,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:37,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:37,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:37,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (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:23:37,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:37,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:37,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:23:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:39,588 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:39,588 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:39,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:39 BoogieIcfgContainer [2019-10-13 21:23:39,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:39,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:39,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:39,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:39,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:36" (1/3) ... [2019-10-13 21:23:39,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f03156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:39, skipping insertion in model container [2019-10-13 21:23:39,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:37" (2/3) ... [2019-10-13 21:23:39,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f03156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:39, skipping insertion in model container [2019-10-13 21:23:39,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:39" (3/3) ... [2019-10-13 21:23:39,608 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:23:39,619 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:39,639 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 21:23:39,661 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 21:23:39,707 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:39,707 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:39,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:39,708 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:39,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:39,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:39,708 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:39,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states. [2019-10-13 21:23:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:23:39,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:39,802 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] [2019-10-13 21:23:39,804 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash -378109419, now seen corresponding path program 1 times [2019-10-13 21:23:39,820 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:39,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059852406] [2019-10-13 21:23:39,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:40,697 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:23:40,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059852406] [2019-10-13 21:23:40,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:40,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:40,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014440456] [2019-10-13 21:23:40,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:40,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:40,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:40,729 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 4 states. [2019-10-13 21:23:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,037 INFO L93 Difference]: Finished difference Result 1140 states and 2047 transitions. [2019-10-13 21:23:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:23:41,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-13 21:23:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,066 INFO L225 Difference]: With dead ends: 1140 [2019-10-13 21:23:41,066 INFO L226 Difference]: Without dead ends: 752 [2019-10-13 21:23:41,072 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:23:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-13 21:23:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 726. [2019-10-13 21:23:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-10-13 21:23:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1035 transitions. [2019-10-13 21:23:41,185 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1035 transitions. Word has length 145 [2019-10-13 21:23:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,185 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1035 transitions. [2019-10-13 21:23:41,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1035 transitions. [2019-10-13 21:23:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:23:41,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,191 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] [2019-10-13 21:23:41,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash 785847517, now seen corresponding path program 1 times [2019-10-13 21:23:41,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747342188] [2019-10-13 21:23:41,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,340 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:23:41,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747342188] [2019-10-13 21:23:41,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:41,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843459433] [2019-10-13 21:23:41,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:41,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:41,345 INFO L87 Difference]: Start difference. First operand 726 states and 1035 transitions. Second operand 3 states. [2019-10-13 21:23:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,407 INFO L93 Difference]: Finished difference Result 2132 states and 3035 transitions. [2019-10-13 21:23:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:41,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-13 21:23:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,417 INFO L225 Difference]: With dead ends: 2132 [2019-10-13 21:23:41,417 INFO L226 Difference]: Without dead ends: 1438 [2019-10-13 21:23:41,421 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:23:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2019-10-13 21:23:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 728. [2019-10-13 21:23:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-13 21:23:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1037 transitions. [2019-10-13 21:23:41,490 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1037 transitions. Word has length 146 [2019-10-13 21:23:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,490 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 1037 transitions. [2019-10-13 21:23:41,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1037 transitions. [2019-10-13 21:23:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:41,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,494 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] [2019-10-13 21:23:41,495 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 615628916, now seen corresponding path program 1 times [2019-10-13 21:23:41,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342141200] [2019-10-13 21:23:41,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,788 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:23:41,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342141200] [2019-10-13 21:23:41,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:41,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849909739] [2019-10-13 21:23:41,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:41,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:41,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:41,791 INFO L87 Difference]: Start difference. First operand 728 states and 1037 transitions. Second operand 4 states. [2019-10-13 21:23:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,941 INFO L93 Difference]: Finished difference Result 1438 states and 2049 transitions. [2019-10-13 21:23:41,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:41,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 21:23:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,948 INFO L225 Difference]: With dead ends: 1438 [2019-10-13 21:23:41,949 INFO L226 Difference]: Without dead ends: 728 [2019-10-13 21:23:41,951 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:23:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-13 21:23:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 727. [2019-10-13 21:23:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-13 21:23:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1034 transitions. [2019-10-13 21:23:41,998 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1034 transitions. Word has length 147 [2019-10-13 21:23:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,999 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1034 transitions. [2019-10-13 21:23:41,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1034 transitions. [2019-10-13 21:23:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:42,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:42,004 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] [2019-10-13 21:23:42,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:42,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:42,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1544797217, now seen corresponding path program 1 times [2019-10-13 21:23:42,006 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:42,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342748432] [2019-10-13 21:23:42,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:42,149 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:23:42,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342748432] [2019-10-13 21:23:42,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:42,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:42,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562779983] [2019-10-13 21:23:42,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:42,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:42,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:42,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:42,152 INFO L87 Difference]: Start difference. First operand 727 states and 1034 transitions. Second operand 3 states. [2019-10-13 21:23:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:42,271 INFO L93 Difference]: Finished difference Result 1957 states and 2793 transitions. [2019-10-13 21:23:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:42,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-13 21:23:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:42,281 INFO L225 Difference]: With dead ends: 1957 [2019-10-13 21:23:42,281 INFO L226 Difference]: Without dead ends: 1409 [2019-10-13 21:23:42,283 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:23:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2019-10-13 21:23:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1383. [2019-10-13 21:23:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-10-13 21:23:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1959 transitions. [2019-10-13 21:23:42,360 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1959 transitions. Word has length 147 [2019-10-13 21:23:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:42,362 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 1959 transitions. [2019-10-13 21:23:42,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1959 transitions. [2019-10-13 21:23:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:23:42,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:42,369 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] [2019-10-13 21:23:42,369 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1137007516, now seen corresponding path program 1 times [2019-10-13 21:23:42,370 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:42,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998906561] [2019-10-13 21:23:42,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:42,598 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:23:42,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998906561] [2019-10-13 21:23:42,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:42,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:42,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728381431] [2019-10-13 21:23:42,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:42,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:42,601 INFO L87 Difference]: Start difference. First operand 1383 states and 1959 transitions. Second operand 4 states. [2019-10-13 21:23:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:42,694 INFO L93 Difference]: Finished difference Result 2275 states and 3231 transitions. [2019-10-13 21:23:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:42,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 21:23:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:42,702 INFO L225 Difference]: With dead ends: 2275 [2019-10-13 21:23:42,702 INFO L226 Difference]: Without dead ends: 1061 [2019-10-13 21:23:42,705 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:23:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-10-13 21:23:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2019-10-13 21:23:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-10-13 21:23:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1494 transitions. [2019-10-13 21:23:42,760 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1494 transitions. Word has length 147 [2019-10-13 21:23:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:42,761 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 1494 transitions. [2019-10-13 21:23:42,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1494 transitions. [2019-10-13 21:23:42,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:23:42,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:42,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] [2019-10-13 21:23:42,765 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:42,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1811444338, now seen corresponding path program 1 times [2019-10-13 21:23:42,766 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:42,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298543443] [2019-10-13 21:23:42,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:42,873 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:23:42,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298543443] [2019-10-13 21:23:42,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:42,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:42,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726767329] [2019-10-13 21:23:42,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:42,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:42,876 INFO L87 Difference]: Start difference. First operand 1061 states and 1494 transitions. Second operand 3 states. [2019-10-13 21:23:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:43,372 INFO L93 Difference]: Finished difference Result 2751 states and 3920 transitions. [2019-10-13 21:23:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:43,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:23:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:43,386 INFO L225 Difference]: With dead ends: 2751 [2019-10-13 21:23:43,387 INFO L226 Difference]: Without dead ends: 1942 [2019-10-13 21:23:43,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:23:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-10-13 21:23:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1916. [2019-10-13 21:23:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2019-10-13 21:23:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2713 transitions. [2019-10-13 21:23:43,488 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2713 transitions. Word has length 153 [2019-10-13 21:23:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:43,488 INFO L462 AbstractCegarLoop]: Abstraction has 1916 states and 2713 transitions. [2019-10-13 21:23:43,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2713 transitions. [2019-10-13 21:23:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:23:43,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:43,493 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] [2019-10-13 21:23:43,493 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash 404324973, now seen corresponding path program 1 times [2019-10-13 21:23:43,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:43,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231395657] [2019-10-13 21:23:43,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:43,931 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:23:43,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231395657] [2019-10-13 21:23:43,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:43,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 21:23:43,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590497074] [2019-10-13 21:23:43,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 21:23:43,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 21:23:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:23:43,934 INFO L87 Difference]: Start difference. First operand 1916 states and 2713 transitions. Second operand 13 states. [2019-10-13 21:23:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:46,215 INFO L93 Difference]: Finished difference Result 7242 states and 11196 transitions. [2019-10-13 21:23:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:23:46,216 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2019-10-13 21:23:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:46,244 INFO L225 Difference]: With dead ends: 7242 [2019-10-13 21:23:46,244 INFO L226 Difference]: Without dead ends: 5602 [2019-10-13 21:23:46,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:23:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2019-10-13 21:23:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 3296. [2019-10-13 21:23:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3296 states. [2019-10-13 21:23:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 4983 transitions. [2019-10-13 21:23:46,484 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 4983 transitions. Word has length 153 [2019-10-13 21:23:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:46,485 INFO L462 AbstractCegarLoop]: Abstraction has 3296 states and 4983 transitions. [2019-10-13 21:23:46,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 21:23:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 4983 transitions. [2019-10-13 21:23:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:23:46,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:46,489 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] [2019-10-13 21:23:46,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash -685965993, now seen corresponding path program 1 times [2019-10-13 21:23:46,490 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:46,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707092238] [2019-10-13 21:23:46,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:46,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:46,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:46,819 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:23:46,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707092238] [2019-10-13 21:23:46,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:46,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:23:46,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100070317] [2019-10-13 21:23:46,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:23:46,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:46,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:23:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:46,822 INFO L87 Difference]: Start difference. First operand 3296 states and 4983 transitions. Second operand 8 states. [2019-10-13 21:23:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:47,249 INFO L93 Difference]: Finished difference Result 6873 states and 10638 transitions. [2019-10-13 21:23:47,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:47,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 153 [2019-10-13 21:23:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:47,275 INFO L225 Difference]: With dead ends: 6873 [2019-10-13 21:23:47,276 INFO L226 Difference]: Without dead ends: 4901 [2019-10-13 21:23:47,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:23:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-10-13 21:23:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 3984. [2019-10-13 21:23:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3984 states. [2019-10-13 21:23:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 5886 transitions. [2019-10-13 21:23:47,569 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 5886 transitions. Word has length 153 [2019-10-13 21:23:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:47,569 INFO L462 AbstractCegarLoop]: Abstraction has 3984 states and 5886 transitions. [2019-10-13 21:23:47,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:23:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 5886 transitions. [2019-10-13 21:23:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:23:47,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:47,575 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] [2019-10-13 21:23:47,575 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:47,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1419709992, now seen corresponding path program 1 times [2019-10-13 21:23:47,576 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:47,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420666986] [2019-10-13 21:23:47,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:47,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:47,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:47,756 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:23:47,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420666986] [2019-10-13 21:23:47,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:47,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:47,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784744689] [2019-10-13 21:23:47,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:47,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:47,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:47,759 INFO L87 Difference]: Start difference. First operand 3984 states and 5886 transitions. Second operand 4 states. [2019-10-13 21:23:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:48,141 INFO L93 Difference]: Finished difference Result 10383 states and 15339 transitions. [2019-10-13 21:23:48,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:48,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:23:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:48,184 INFO L225 Difference]: With dead ends: 10383 [2019-10-13 21:23:48,184 INFO L226 Difference]: Without dead ends: 6426 [2019-10-13 21:23:48,196 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:23:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6426 states. [2019-10-13 21:23:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6426 to 6404. [2019-10-13 21:23:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6404 states. [2019-10-13 21:23:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6404 states to 6404 states and 9378 transitions. [2019-10-13 21:23:48,632 INFO L78 Accepts]: Start accepts. Automaton has 6404 states and 9378 transitions. Word has length 153 [2019-10-13 21:23:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:48,638 INFO L462 AbstractCegarLoop]: Abstraction has 6404 states and 9378 transitions. [2019-10-13 21:23:48,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6404 states and 9378 transitions. [2019-10-13 21:23:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:23:48,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:48,648 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] [2019-10-13 21:23:48,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1518674242, now seen corresponding path program 1 times [2019-10-13 21:23:48,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:48,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257391624] [2019-10-13 21:23:48,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:48,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:48,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:48,757 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:23:48,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257391624] [2019-10-13 21:23:48,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:48,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:48,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893121659] [2019-10-13 21:23:48,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:48,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:48,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:48,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:48,761 INFO L87 Difference]: Start difference. First operand 6404 states and 9378 transitions. Second operand 3 states. [2019-10-13 21:23:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:49,302 INFO L93 Difference]: Finished difference Result 16047 states and 23518 transitions. [2019-10-13 21:23:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:49,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-13 21:23:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:49,327 INFO L225 Difference]: With dead ends: 16047 [2019-10-13 21:23:49,328 INFO L226 Difference]: Without dead ends: 9996 [2019-10-13 21:23:49,340 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:23:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2019-10-13 21:23:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 9976. [2019-10-13 21:23:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9976 states. [2019-10-13 21:23:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9976 states to 9976 states and 14410 transitions. [2019-10-13 21:23:49,912 INFO L78 Accepts]: Start accepts. Automaton has 9976 states and 14410 transitions. Word has length 155 [2019-10-13 21:23:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:49,913 INFO L462 AbstractCegarLoop]: Abstraction has 9976 states and 14410 transitions. [2019-10-13 21:23:49,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9976 states and 14410 transitions. [2019-10-13 21:23:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:23:49,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:49,925 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] [2019-10-13 21:23:49,926 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:49,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:49,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1456809787, now seen corresponding path program 1 times [2019-10-13 21:23:49,927 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:49,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751425350] [2019-10-13 21:23:49,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:50,132 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:23:50,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751425350] [2019-10-13 21:23:50,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:50,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:50,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269635693] [2019-10-13 21:23:50,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:50,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:50,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:50,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:50,135 INFO L87 Difference]: Start difference. First operand 9976 states and 14410 transitions. Second operand 4 states. [2019-10-13 21:23:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:51,082 INFO L93 Difference]: Finished difference Result 20942 states and 30881 transitions. [2019-10-13 21:23:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:51,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-13 21:23:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:51,110 INFO L225 Difference]: With dead ends: 20942 [2019-10-13 21:23:51,111 INFO L226 Difference]: Without dead ends: 16040 [2019-10-13 21:23:51,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16040 states. [2019-10-13 21:23:52,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16040 to 16038. [2019-10-13 21:23:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16038 states. [2019-10-13 21:23:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16038 states to 16038 states and 22893 transitions. [2019-10-13 21:23:52,479 INFO L78 Accepts]: Start accepts. Automaton has 16038 states and 22893 transitions. Word has length 161 [2019-10-13 21:23:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:52,480 INFO L462 AbstractCegarLoop]: Abstraction has 16038 states and 22893 transitions. [2019-10-13 21:23:52,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 16038 states and 22893 transitions. [2019-10-13 21:23:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:23:52,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:52,499 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] [2019-10-13 21:23:52,500 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:52,500 INFO L82 PathProgramCache]: Analyzing trace with hash -833013491, now seen corresponding path program 1 times [2019-10-13 21:23:52,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:52,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770130026] [2019-10-13 21:23:52,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:52,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:52,677 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:23:52,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770130026] [2019-10-13 21:23:52,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:52,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:52,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952391465] [2019-10-13 21:23:52,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:52,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:52,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:52,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:52,679 INFO L87 Difference]: Start difference. First operand 16038 states and 22893 transitions. Second operand 4 states. [2019-10-13 21:23:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:54,074 INFO L93 Difference]: Finished difference Result 46992 states and 66908 transitions. [2019-10-13 21:23:54,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:54,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-13 21:23:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:54,122 INFO L225 Difference]: With dead ends: 46992 [2019-10-13 21:23:54,122 INFO L226 Difference]: Without dead ends: 30997 [2019-10-13 21:23:54,147 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:23:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30997 states. [2019-10-13 21:23:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30997 to 30947. [2019-10-13 21:23:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30947 states. [2019-10-13 21:23:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30947 states to 30947 states and 43619 transitions. [2019-10-13 21:23:55,442 INFO L78 Accepts]: Start accepts. Automaton has 30947 states and 43619 transitions. Word has length 161 [2019-10-13 21:23:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:55,442 INFO L462 AbstractCegarLoop]: Abstraction has 30947 states and 43619 transitions. [2019-10-13 21:23:55,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 30947 states and 43619 transitions. [2019-10-13 21:23:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:23:55,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:55,476 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:23:55,476 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:55,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1467447725, now seen corresponding path program 1 times [2019-10-13 21:23:55,477 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:55,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041345148] [2019-10-13 21:23:55,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:55,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:55,536 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:23:55,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041345148] [2019-10-13 21:23:55,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:55,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:55,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541975220] [2019-10-13 21:23:55,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:55,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:55,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:55,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:55,539 INFO L87 Difference]: Start difference. First operand 30947 states and 43619 transitions. Second operand 3 states. [2019-10-13 21:23:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:58,435 INFO L93 Difference]: Finished difference Result 92649 states and 130610 transitions. [2019-10-13 21:23:58,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:58,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-13 21:23:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:58,496 INFO L225 Difference]: With dead ends: 92649 [2019-10-13 21:23:58,496 INFO L226 Difference]: Without dead ends: 61807 [2019-10-13 21:23:58,539 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:23:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61807 states. [2019-10-13 21:24:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61807 to 30953. [2019-10-13 21:24:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30953 states. [2019-10-13 21:24:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30953 states to 30953 states and 43625 transitions. [2019-10-13 21:24:00,117 INFO L78 Accepts]: Start accepts. Automaton has 30953 states and 43625 transitions. Word has length 162 [2019-10-13 21:24:00,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:00,117 INFO L462 AbstractCegarLoop]: Abstraction has 30953 states and 43625 transitions. [2019-10-13 21:24:00,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 30953 states and 43625 transitions. [2019-10-13 21:24:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:24:00,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:00,145 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] [2019-10-13 21:24:00,146 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1559304139, now seen corresponding path program 1 times [2019-10-13 21:24:00,146 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:00,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074904495] [2019-10-13 21:24:00,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:00,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:00,239 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:00,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074904495] [2019-10-13 21:24:00,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:00,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:00,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265754237] [2019-10-13 21:24:00,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:00,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:00,241 INFO L87 Difference]: Start difference. First operand 30953 states and 43625 transitions. Second operand 3 states. [2019-10-13 21:24:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:02,809 INFO L93 Difference]: Finished difference Result 80878 states and 113504 transitions. [2019-10-13 21:24:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:02,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-13 21:24:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:02,863 INFO L225 Difference]: With dead ends: 80878 [2019-10-13 21:24:02,863 INFO L226 Difference]: Without dead ends: 50606 [2019-10-13 21:24:02,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:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50606 states. [2019-10-13 21:24:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50606 to 50556. [2019-10-13 21:24:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50556 states. [2019-10-13 21:24:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50556 states to 50556 states and 69850 transitions. [2019-10-13 21:24:06,089 INFO L78 Accepts]: Start accepts. Automaton has 50556 states and 69850 transitions. Word has length 163 [2019-10-13 21:24:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:06,090 INFO L462 AbstractCegarLoop]: Abstraction has 50556 states and 69850 transitions. [2019-10-13 21:24:06,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 50556 states and 69850 transitions. [2019-10-13 21:24:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:24:06,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:06,116 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] [2019-10-13 21:24:06,116 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash 610567160, now seen corresponding path program 1 times [2019-10-13 21:24:06,117 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:06,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987333601] [2019-10-13 21:24:06,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:06,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:06,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:06,243 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:06,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987333601] [2019-10-13 21:24:06,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:06,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:06,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590418535] [2019-10-13 21:24:06,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:06,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:06,246 INFO L87 Difference]: Start difference. First operand 50556 states and 69850 transitions. Second operand 4 states. [2019-10-13 21:24:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:08,516 INFO L93 Difference]: Finished difference Result 95832 states and 132707 transitions. [2019-10-13 21:24:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:08,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-13 21:24:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:08,555 INFO L225 Difference]: With dead ends: 95832 [2019-10-13 21:24:08,555 INFO L226 Difference]: Without dead ends: 45895 [2019-10-13 21:24:08,586 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:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45895 states.