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/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:24:17,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:24:17,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:24:17,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:24:17,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:24:17,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:24:17,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:24:17,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:24:17,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:24:17,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:24:17,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:24:17,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:24:17,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:24:17,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:24:17,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:24:17,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:24:17,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:24:17,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:24:17,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:24:17,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:24:17,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:24:17,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:24:17,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:24:17,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:24:17,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:24:17,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:24:17,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:24:17,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:24:17,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:24:17,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:24:17,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:24:17,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:24:17,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:24:17,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:24:17,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:24:17,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:24:17,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:24:17,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:24:17,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:24:17,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:24:17,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:24:17,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:24:17,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:24:17,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:24:17,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:24:17,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:24:17,153 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:24:17,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:24:17,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:24:17,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:24:17,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:24:17,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:24:17,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:24:17,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:24:17,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:24:17,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:24:17,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:24:17,156 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:24:17,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:24:17,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:24:17,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:24:17,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:24:17,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:24:17,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:24:17,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:24:17,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:24:17,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:24:17,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:24:17,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:24:17,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:24:17,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:24:17,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:24:17,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:24:17,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:24:17,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:24:17,454 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:24:17,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:17,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf34f6e2/4bf1164f010240c393321e5e30d04b63/FLAG035936548 [2019-10-15 01:24:18,043 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:24:18,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:18,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf34f6e2/4bf1164f010240c393321e5e30d04b63/FLAG035936548 [2019-10-15 01:24:18,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf34f6e2/4bf1164f010240c393321e5e30d04b63 [2019-10-15 01:24:18,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:24:18,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:24:18,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:18,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:24:18,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:24:18,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:18" (1/1) ... [2019-10-15 01:24:18,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cbab6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:18, skipping insertion in model container [2019-10-15 01:24:18,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:24:18" (1/1) ... [2019-10-15 01:24:18,368 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:24:18,423 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:24:18,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:18,980 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:24:19,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:24:19,109 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:24:19,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19 WrapperNode [2019-10-15 01:24:19,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:24:19,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:24:19,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:24:19,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:24:19,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (1/1) ... [2019-10-15 01:24:19,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (1/1) ... [2019-10-15 01:24:19,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (1/1) ... [2019-10-15 01:24:19,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (1/1) ... [2019-10-15 01:24:19,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (1/1) ... [2019-10-15 01:24:19,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (1/1) ... [2019-10-15 01:24:19,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (1/1) ... [2019-10-15 01:24:19,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:24:19,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:24:19,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:24:19,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:24:19,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:24:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:24:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:24:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-15 01:24:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-15 01:24:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-15 01:24:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-15 01:24:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-15 01:24:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-15 01:24:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-15 01:24:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-15 01:24:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 01:24:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-15 01:24:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-15 01:24:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-15 01:24:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-15 01:24:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-15 01:24:19,261 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 01:24:19,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:24:19,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 01:24:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:24:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:24:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:24:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:24:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:24:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:24:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:24:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-15 01:24:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-15 01:24:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-15 01:24:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-15 01:24:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-15 01:24:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-15 01:24:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-15 01:24:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-15 01:24:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:24:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-15 01:24:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-15 01:24:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-15 01:24:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-15 01:24:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-15 01:24:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:24:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:24:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:24:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:24:20,137 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:24:20,138 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:24:20,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:20 BoogieIcfgContainer [2019-10-15 01:24:20,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:24:20,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:24:20,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:24:20,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:24:20,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:24:18" (1/3) ... [2019-10-15 01:24:20,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc6b11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:20, skipping insertion in model container [2019-10-15 01:24:20,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:24:19" (2/3) ... [2019-10-15 01:24:20,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc6b11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:24:20, skipping insertion in model container [2019-10-15 01:24:20,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:24:20" (3/3) ... [2019-10-15 01:24:20,147 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-15 01:24:20,154 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:24:20,163 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:24:20,175 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:24:20,203 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:24:20,203 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:24:20,203 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:24:20,204 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:24:20,204 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:24:20,204 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:24:20,204 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:24:20,205 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:24:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-15 01:24:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:24:20,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:20,238 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] [2019-10-15 01:24:20,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -95402615, now seen corresponding path program 1 times [2019-10-15 01:24:20,257 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:20,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805679207] [2019-10-15 01:24:20,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:20,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:20,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:20,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805679207] [2019-10-15 01:24:20,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:20,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:20,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860030462] [2019-10-15 01:24:20,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:20,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:20,754 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 4 states. [2019-10-15 01:24:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:20,892 INFO L93 Difference]: Finished difference Result 448 states and 692 transitions. [2019-10-15 01:24:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:20,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-15 01:24:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:20,918 INFO L225 Difference]: With dead ends: 448 [2019-10-15 01:24:20,918 INFO L226 Difference]: Without dead ends: 231 [2019-10-15 01:24:20,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-15 01:24:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-10-15 01:24:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-15 01:24:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2019-10-15 01:24:20,994 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 65 [2019-10-15 01:24:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:20,994 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2019-10-15 01:24:20,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2019-10-15 01:24:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:24:20,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:20,999 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] [2019-10-15 01:24:20,999 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:21,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1971874243, now seen corresponding path program 1 times [2019-10-15 01:24:21,000 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:21,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003189810] [2019-10-15 01:24:21,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:21,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:21,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:21,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003189810] [2019-10-15 01:24:21,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:21,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:21,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749873041] [2019-10-15 01:24:21,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:21,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:21,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:21,273 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand 4 states. [2019-10-15 01:24:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:21,404 INFO L93 Difference]: Finished difference Result 444 states and 634 transitions. [2019-10-15 01:24:21,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:21,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 01:24:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:21,412 INFO L225 Difference]: With dead ends: 444 [2019-10-15 01:24:21,414 INFO L226 Difference]: Without dead ends: 235 [2019-10-15 01:24:21,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-15 01:24:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-10-15 01:24:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-15 01:24:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 326 transitions. [2019-10-15 01:24:21,458 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 326 transitions. Word has length 76 [2019-10-15 01:24:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:21,459 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 326 transitions. [2019-10-15 01:24:21,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 326 transitions. [2019-10-15 01:24:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:24:21,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:21,463 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] [2019-10-15 01:24:21,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:21,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash 350215030, now seen corresponding path program 1 times [2019-10-15 01:24:21,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:21,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052319954] [2019-10-15 01:24:21,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:21,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:21,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:21,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052319954] [2019-10-15 01:24:21,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:21,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:21,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594307372] [2019-10-15 01:24:21,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:21,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:21,658 INFO L87 Difference]: Start difference. First operand 235 states and 326 transitions. Second operand 7 states. [2019-10-15 01:24:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:22,938 INFO L93 Difference]: Finished difference Result 535 states and 744 transitions. [2019-10-15 01:24:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:22,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-15 01:24:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:22,950 INFO L225 Difference]: With dead ends: 535 [2019-10-15 01:24:22,950 INFO L226 Difference]: Without dead ends: 322 [2019-10-15 01:24:22,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-15 01:24:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-10-15 01:24:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-15 01:24:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2019-10-15 01:24:23,012 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 94 [2019-10-15 01:24:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:23,013 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2019-10-15 01:24:23,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2019-10-15 01:24:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:24:23,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:23,018 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] [2019-10-15 01:24:23,019 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1125111825, now seen corresponding path program 1 times [2019-10-15 01:24:23,019 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:23,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96192433] [2019-10-15 01:24:23,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:23,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:23,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:23,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96192433] [2019-10-15 01:24:23,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:23,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:23,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434358360] [2019-10-15 01:24:23,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:23,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:23,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:23,190 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand 7 states. [2019-10-15 01:24:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,360 INFO L93 Difference]: Finished difference Result 541 states and 752 transitions. [2019-10-15 01:24:24,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:24:24,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:24:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,364 INFO L225 Difference]: With dead ends: 541 [2019-10-15 01:24:24,364 INFO L226 Difference]: Without dead ends: 325 [2019-10-15 01:24:24,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-15 01:24:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2019-10-15 01:24:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-15 01:24:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2019-10-15 01:24:24,389 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 95 [2019-10-15 01:24:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,389 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2019-10-15 01:24:24,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2019-10-15 01:24:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:24:24,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,391 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] [2019-10-15 01:24:24,391 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1068609311, now seen corresponding path program 1 times [2019-10-15 01:24:24,392 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892194489] [2019-10-15 01:24:24,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:24,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892194489] [2019-10-15 01:24:24,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:24,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90602158] [2019-10-15 01:24:24,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:24,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:24,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:24,481 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand 3 states. [2019-10-15 01:24:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,546 INFO L93 Difference]: Finished difference Result 770 states and 1075 transitions. [2019-10-15 01:24:24,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:24,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-15 01:24:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,555 INFO L225 Difference]: With dead ends: 770 [2019-10-15 01:24:24,555 INFO L226 Difference]: Without dead ends: 554 [2019-10-15 01:24:24,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-15 01:24:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 537. [2019-10-15 01:24:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-15 01:24:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 745 transitions. [2019-10-15 01:24:24,625 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 745 transitions. Word has length 97 [2019-10-15 01:24:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,627 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 745 transitions. [2019-10-15 01:24:24,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 745 transitions. [2019-10-15 01:24:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:24:24,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,639 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] [2019-10-15 01:24:24,639 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2002189277, now seen corresponding path program 1 times [2019-10-15 01:24:24,641 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892750527] [2019-10-15 01:24:24,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:24,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892750527] [2019-10-15 01:24:24,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:24,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329758503] [2019-10-15 01:24:24,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:24,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:24,779 INFO L87 Difference]: Start difference. First operand 537 states and 745 transitions. Second operand 3 states. [2019-10-15 01:24:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:24,827 INFO L93 Difference]: Finished difference Result 927 states and 1308 transitions. [2019-10-15 01:24:24,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:24,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-15 01:24:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:24,833 INFO L225 Difference]: With dead ends: 927 [2019-10-15 01:24:24,833 INFO L226 Difference]: Without dead ends: 537 [2019-10-15 01:24:24,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-15 01:24:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-10-15 01:24:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-15 01:24:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 744 transitions. [2019-10-15 01:24:24,910 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 744 transitions. Word has length 98 [2019-10-15 01:24:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:24,912 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 744 transitions. [2019-10-15 01:24:24,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 744 transitions. [2019-10-15 01:24:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:24:24,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:24,914 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] [2019-10-15 01:24:24,914 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:24,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1591713441, now seen corresponding path program 1 times [2019-10-15 01:24:24,915 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:24,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290283700] [2019-10-15 01:24:24,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:24,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:24,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290283700] [2019-10-15 01:24:24,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:24,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:24,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305702461] [2019-10-15 01:24:24,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:24,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:24,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:24,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:24,994 INFO L87 Difference]: Start difference. First operand 537 states and 744 transitions. Second operand 3 states. [2019-10-15 01:24:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,050 INFO L93 Difference]: Finished difference Result 1168 states and 1640 transitions. [2019-10-15 01:24:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:25,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-15 01:24:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,056 INFO L225 Difference]: With dead ends: 1168 [2019-10-15 01:24:25,056 INFO L226 Difference]: Without dead ends: 728 [2019-10-15 01:24:25,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-15 01:24:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 722. [2019-10-15 01:24:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-15 01:24:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1008 transitions. [2019-10-15 01:24:25,103 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1008 transitions. Word has length 98 [2019-10-15 01:24:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,103 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1008 transitions. [2019-10-15 01:24:25,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1008 transitions. [2019-10-15 01:24:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:24:25,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,105 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] [2019-10-15 01:24:25,106 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1901314178, now seen corresponding path program 1 times [2019-10-15 01:24:25,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569809520] [2019-10-15 01:24:25,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:25,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569809520] [2019-10-15 01:24:25,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051578029] [2019-10-15 01:24:25,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,198 INFO L87 Difference]: Start difference. First operand 722 states and 1008 transitions. Second operand 4 states. [2019-10-15 01:24:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,268 INFO L93 Difference]: Finished difference Result 1308 states and 1853 transitions. [2019-10-15 01:24:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:25,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-15 01:24:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,274 INFO L225 Difference]: With dead ends: 1308 [2019-10-15 01:24:25,275 INFO L226 Difference]: Without dead ends: 737 [2019-10-15 01:24:25,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-15 01:24:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-10-15 01:24:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-10-15 01:24:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1020 transitions. [2019-10-15 01:24:25,321 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1020 transitions. Word has length 98 [2019-10-15 01:24:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,322 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1020 transitions. [2019-10-15 01:24:25,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1020 transitions. [2019-10-15 01:24:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:24:25,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1229557918, now seen corresponding path program 1 times [2019-10-15 01:24:25,325 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688022457] [2019-10-15 01:24:25,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:25,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688022457] [2019-10-15 01:24:25,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622691436] [2019-10-15 01:24:25,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,409 INFO L87 Difference]: Start difference. First operand 737 states and 1020 transitions. Second operand 4 states. [2019-10-15 01:24:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,486 INFO L93 Difference]: Finished difference Result 1338 states and 1886 transitions. [2019-10-15 01:24:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:25,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-15 01:24:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,492 INFO L225 Difference]: With dead ends: 1338 [2019-10-15 01:24:25,492 INFO L226 Difference]: Without dead ends: 752 [2019-10-15 01:24:25,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-15 01:24:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2019-10-15 01:24:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-10-15 01:24:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1032 transitions. [2019-10-15 01:24:25,535 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1032 transitions. Word has length 106 [2019-10-15 01:24:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,536 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1032 transitions. [2019-10-15 01:24:25,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1032 transitions. [2019-10-15 01:24:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:24:25,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,564 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,564 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1709526252, now seen corresponding path program 1 times [2019-10-15 01:24:25,565 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949183758] [2019-10-15 01:24:25,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:25,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949183758] [2019-10-15 01:24:25,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385864159] [2019-10-15 01:24:25,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,648 INFO L87 Difference]: Start difference. First operand 752 states and 1032 transitions. Second operand 4 states. [2019-10-15 01:24:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,714 INFO L93 Difference]: Finished difference Result 1365 states and 1898 transitions. [2019-10-15 01:24:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:25,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:24:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,720 INFO L225 Difference]: With dead ends: 1365 [2019-10-15 01:24:25,720 INFO L226 Difference]: Without dead ends: 764 [2019-10-15 01:24:25,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-10-15 01:24:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-10-15 01:24:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-10-15 01:24:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1041 transitions. [2019-10-15 01:24:25,771 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1041 transitions. Word has length 114 [2019-10-15 01:24:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:25,771 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1041 transitions. [2019-10-15 01:24:25,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1041 transitions. [2019-10-15 01:24:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:24:25,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:25,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:25,774 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash -20152056, now seen corresponding path program 1 times [2019-10-15 01:24:25,775 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:25,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326355291] [2019-10-15 01:24:25,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:25,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:25,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326355291] [2019-10-15 01:24:25,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:25,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:25,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203134363] [2019-10-15 01:24:25,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:25,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:25,873 INFO L87 Difference]: Start difference. First operand 764 states and 1041 transitions. Second operand 4 states. [2019-10-15 01:24:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:25,958 INFO L93 Difference]: Finished difference Result 1392 states and 1928 transitions. [2019-10-15 01:24:25,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:25,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:24:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:25,966 INFO L225 Difference]: With dead ends: 1392 [2019-10-15 01:24:25,966 INFO L226 Difference]: Without dead ends: 779 [2019-10-15 01:24:25,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-15 01:24:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2019-10-15 01:24:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-10-15 01:24:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1053 transitions. [2019-10-15 01:24:26,029 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1053 transitions. Word has length 114 [2019-10-15 01:24:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,030 INFO L462 AbstractCegarLoop]: Abstraction has 779 states and 1053 transitions. [2019-10-15 01:24:26,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1053 transitions. [2019-10-15 01:24:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:24:26,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,036 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:26,036 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1453300596, now seen corresponding path program 1 times [2019-10-15 01:24:26,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593486801] [2019-10-15 01:24:26,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:24:26,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593486801] [2019-10-15 01:24:26,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:26,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878594948] [2019-10-15 01:24:26,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:26,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:26,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:26,153 INFO L87 Difference]: Start difference. First operand 779 states and 1053 transitions. Second operand 4 states. [2019-10-15 01:24:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:26,222 INFO L93 Difference]: Finished difference Result 1425 states and 1949 transitions. [2019-10-15 01:24:26,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:26,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-15 01:24:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:26,228 INFO L225 Difference]: With dead ends: 1425 [2019-10-15 01:24:26,228 INFO L226 Difference]: Without dead ends: 797 [2019-10-15 01:24:26,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-10-15 01:24:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-10-15 01:24:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-15 01:24:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1068 transitions. [2019-10-15 01:24:26,282 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1068 transitions. Word has length 122 [2019-10-15 01:24:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:26,285 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1068 transitions. [2019-10-15 01:24:26,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1068 transitions. [2019-10-15 01:24:26,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:24:26,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:26,288 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:26,288 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:26,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1290490955, now seen corresponding path program 1 times [2019-10-15 01:24:26,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:26,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324252432] [2019-10-15 01:24:26,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:26,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:24:26,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324252432] [2019-10-15 01:24:26,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:26,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:24:26,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523064341] [2019-10-15 01:24:26,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:24:26,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:26,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:24:26,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:24:26,571 INFO L87 Difference]: Start difference. First operand 797 states and 1068 transitions. Second operand 10 states. [2019-10-15 01:24:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:29,594 INFO L93 Difference]: Finished difference Result 2083 states and 2774 transitions. [2019-10-15 01:24:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:24:29,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-10-15 01:24:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:29,607 INFO L225 Difference]: With dead ends: 2083 [2019-10-15 01:24:29,607 INFO L226 Difference]: Without dead ends: 1428 [2019-10-15 01:24:29,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:24:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-10-15 01:24:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1335. [2019-10-15 01:24:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2019-10-15 01:24:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1758 transitions. [2019-10-15 01:24:29,716 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1758 transitions. Word has length 127 [2019-10-15 01:24:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:29,717 INFO L462 AbstractCegarLoop]: Abstraction has 1335 states and 1758 transitions. [2019-10-15 01:24:29,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:24:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1758 transitions. [2019-10-15 01:24:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:24:29,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:29,722 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:29,722 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1610878183, now seen corresponding path program 1 times [2019-10-15 01:24:29,723 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:29,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317694810] [2019-10-15 01:24:29,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:29,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:29,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:24:29,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317694810] [2019-10-15 01:24:29,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:29,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:29,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259305024] [2019-10-15 01:24:29,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:29,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:29,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:29,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:29,852 INFO L87 Difference]: Start difference. First operand 1335 states and 1758 transitions. Second operand 4 states. [2019-10-15 01:24:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:30,026 INFO L93 Difference]: Finished difference Result 2422 states and 3209 transitions. [2019-10-15 01:24:30,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:30,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-15 01:24:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:30,035 INFO L225 Difference]: With dead ends: 2422 [2019-10-15 01:24:30,036 INFO L226 Difference]: Without dead ends: 1347 [2019-10-15 01:24:30,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:30,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-10-15 01:24:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1341. [2019-10-15 01:24:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2019-10-15 01:24:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1745 transitions. [2019-10-15 01:24:30,146 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1745 transitions. Word has length 129 [2019-10-15 01:24:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:30,147 INFO L462 AbstractCegarLoop]: Abstraction has 1341 states and 1745 transitions. [2019-10-15 01:24:30,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1745 transitions. [2019-10-15 01:24:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 01:24:30,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:30,151 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:30,151 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1804269052, now seen corresponding path program 1 times [2019-10-15 01:24:30,152 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:30,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377996074] [2019-10-15 01:24:30,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:30,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:30,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 01:24:30,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377996074] [2019-10-15 01:24:30,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:30,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:30,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450319178] [2019-10-15 01:24:30,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:30,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:30,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:30,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:30,278 INFO L87 Difference]: Start difference. First operand 1341 states and 1745 transitions. Second operand 9 states. [2019-10-15 01:24:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:32,311 INFO L93 Difference]: Finished difference Result 2761 states and 3567 transitions. [2019-10-15 01:24:32,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:24:32,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-10-15 01:24:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:32,322 INFO L225 Difference]: With dead ends: 2761 [2019-10-15 01:24:32,322 INFO L226 Difference]: Without dead ends: 1731 [2019-10-15 01:24:32,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:24:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2019-10-15 01:24:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1464. [2019-10-15 01:24:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-10-15 01:24:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1879 transitions. [2019-10-15 01:24:32,406 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1879 transitions. Word has length 131 [2019-10-15 01:24:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:32,407 INFO L462 AbstractCegarLoop]: Abstraction has 1464 states and 1879 transitions. [2019-10-15 01:24:32,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1879 transitions. [2019-10-15 01:24:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:24:32,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:32,409 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:32,410 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:32,410 INFO L82 PathProgramCache]: Analyzing trace with hash 77285222, now seen corresponding path program 1 times [2019-10-15 01:24:32,410 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:32,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697655940] [2019-10-15 01:24:32,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:32,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:32,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:24:32,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697655940] [2019-10-15 01:24:32,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:32,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:24:32,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449183724] [2019-10-15 01:24:32,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:24:32,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:24:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:32,530 INFO L87 Difference]: Start difference. First operand 1464 states and 1879 transitions. Second operand 7 states. [2019-10-15 01:24:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:32,668 INFO L93 Difference]: Finished difference Result 1563 states and 2020 transitions. [2019-10-15 01:24:32,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:24:32,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-15 01:24:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:32,679 INFO L225 Difference]: With dead ends: 1563 [2019-10-15 01:24:32,680 INFO L226 Difference]: Without dead ends: 1561 [2019-10-15 01:24:32,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-10-15 01:24:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1485. [2019-10-15 01:24:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2019-10-15 01:24:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1902 transitions. [2019-10-15 01:24:32,781 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1902 transitions. Word has length 130 [2019-10-15 01:24:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:32,781 INFO L462 AbstractCegarLoop]: Abstraction has 1485 states and 1902 transitions. [2019-10-15 01:24:32,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:24:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1902 transitions. [2019-10-15 01:24:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:24:32,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:32,785 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:32,785 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1402644889, now seen corresponding path program 1 times [2019-10-15 01:24:32,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:32,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349331245] [2019-10-15 01:24:32,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:32,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:32,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:24:33,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349331245] [2019-10-15 01:24:33,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:33,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:24:33,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831616975] [2019-10-15 01:24:33,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:24:33,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:33,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:24:33,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:24:33,064 INFO L87 Difference]: Start difference. First operand 1485 states and 1902 transitions. Second operand 10 states. [2019-10-15 01:24:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:36,384 INFO L93 Difference]: Finished difference Result 3885 states and 4945 transitions. [2019-10-15 01:24:36,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:24:36,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2019-10-15 01:24:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:36,400 INFO L225 Difference]: With dead ends: 3885 [2019-10-15 01:24:36,400 INFO L226 Difference]: Without dead ends: 2753 [2019-10-15 01:24:36,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:24:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2019-10-15 01:24:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 1910. [2019-10-15 01:24:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-15 01:24:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2432 transitions. [2019-10-15 01:24:36,531 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2432 transitions. Word has length 135 [2019-10-15 01:24:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:36,532 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2432 transitions. [2019-10-15 01:24:36,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:24:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2432 transitions. [2019-10-15 01:24:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:24:36,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:36,535 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:36,535 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:36,536 INFO L82 PathProgramCache]: Analyzing trace with hash 168273907, now seen corresponding path program 1 times [2019-10-15 01:24:36,536 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:36,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029661458] [2019-10-15 01:24:36,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:36,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:36,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:36,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029661458] [2019-10-15 01:24:36,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:36,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:36,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359912356] [2019-10-15 01:24:36,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:36,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:36,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:36,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:36,685 INFO L87 Difference]: Start difference. First operand 1910 states and 2432 transitions. Second operand 5 states. [2019-10-15 01:24:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:37,258 INFO L93 Difference]: Finished difference Result 6592 states and 8494 transitions. [2019-10-15 01:24:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:37,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-15 01:24:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:37,330 INFO L225 Difference]: With dead ends: 6592 [2019-10-15 01:24:37,330 INFO L226 Difference]: Without dead ends: 4980 [2019-10-15 01:24:37,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4980 states. [2019-10-15 01:24:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4980 to 4524. [2019-10-15 01:24:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4524 states. [2019-10-15 01:24:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5774 transitions. [2019-10-15 01:24:37,621 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5774 transitions. Word has length 136 [2019-10-15 01:24:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:37,622 INFO L462 AbstractCegarLoop]: Abstraction has 4524 states and 5774 transitions. [2019-10-15 01:24:37,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5774 transitions. [2019-10-15 01:24:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:24:37,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:37,626 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:37,626 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:37,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:37,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2010406403, now seen corresponding path program 1 times [2019-10-15 01:24:37,627 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:37,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156690405] [2019-10-15 01:24:37,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:37,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:37,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:24:37,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156690405] [2019-10-15 01:24:37,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:37,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:37,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39533061] [2019-10-15 01:24:37,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:37,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:37,850 INFO L87 Difference]: Start difference. First operand 4524 states and 5774 transitions. Second operand 9 states. [2019-10-15 01:24:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:39,572 INFO L93 Difference]: Finished difference Result 7988 states and 10286 transitions. [2019-10-15 01:24:39,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:24:39,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-15 01:24:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:39,601 INFO L225 Difference]: With dead ends: 7988 [2019-10-15 01:24:39,602 INFO L226 Difference]: Without dead ends: 4063 [2019-10-15 01:24:39,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:24:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2019-10-15 01:24:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 3498. [2019-10-15 01:24:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3498 states. [2019-10-15 01:24:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4456 transitions. [2019-10-15 01:24:39,918 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4456 transitions. Word has length 137 [2019-10-15 01:24:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:39,920 INFO L462 AbstractCegarLoop]: Abstraction has 3498 states and 4456 transitions. [2019-10-15 01:24:39,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4456 transitions. [2019-10-15 01:24:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:24:39,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:39,926 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:39,926 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash 536828905, now seen corresponding path program 1 times [2019-10-15 01:24:39,927 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:39,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824130403] [2019-10-15 01:24:39,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:39,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:24:40,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824130403] [2019-10-15 01:24:40,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:40,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:40,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144876494] [2019-10-15 01:24:40,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:40,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:40,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:40,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:40,151 INFO L87 Difference]: Start difference. First operand 3498 states and 4456 transitions. Second operand 9 states. [2019-10-15 01:24:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:41,884 INFO L93 Difference]: Finished difference Result 7105 states and 9198 transitions. [2019-10-15 01:24:41,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:24:41,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-10-15 01:24:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:41,907 INFO L225 Difference]: With dead ends: 7105 [2019-10-15 01:24:41,907 INFO L226 Difference]: Without dead ends: 3963 [2019-10-15 01:24:41,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:24:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2019-10-15 01:24:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3399. [2019-10-15 01:24:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2019-10-15 01:24:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4331 transitions. [2019-10-15 01:24:42,123 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4331 transitions. Word has length 138 [2019-10-15 01:24:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:42,124 INFO L462 AbstractCegarLoop]: Abstraction has 3399 states and 4331 transitions. [2019-10-15 01:24:42,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4331 transitions. [2019-10-15 01:24:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:24:42,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:42,127 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:42,127 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:42,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1537146296, now seen corresponding path program 1 times [2019-10-15 01:24:42,128 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:42,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763099035] [2019-10-15 01:24:42,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:42,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:42,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763099035] [2019-10-15 01:24:42,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:42,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:42,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881003966] [2019-10-15 01:24:42,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:42,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:42,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:42,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:42,208 INFO L87 Difference]: Start difference. First operand 3399 states and 4331 transitions. Second operand 5 states. [2019-10-15 01:24:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:42,770 INFO L93 Difference]: Finished difference Result 10453 states and 13435 transitions. [2019-10-15 01:24:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:42,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-15 01:24:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:42,804 INFO L225 Difference]: With dead ends: 10453 [2019-10-15 01:24:42,804 INFO L226 Difference]: Without dead ends: 7571 [2019-10-15 01:24:42,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-10-15 01:24:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 5216. [2019-10-15 01:24:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5216 states. [2019-10-15 01:24:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 6637 transitions. [2019-10-15 01:24:43,248 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 6637 transitions. Word has length 139 [2019-10-15 01:24:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:43,249 INFO L462 AbstractCegarLoop]: Abstraction has 5216 states and 6637 transitions. [2019-10-15 01:24:43,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 6637 transitions. [2019-10-15 01:24:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:24:43,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:43,253 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:43,253 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -541847865, now seen corresponding path program 1 times [2019-10-15 01:24:43,253 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:43,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487387184] [2019-10-15 01:24:43,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:43,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:43,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:43,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487387184] [2019-10-15 01:24:43,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:43,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:24:43,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185792207] [2019-10-15 01:24:43,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:24:43,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:43,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:24:43,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:43,338 INFO L87 Difference]: Start difference. First operand 5216 states and 6637 transitions. Second operand 5 states. [2019-10-15 01:24:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:43,972 INFO L93 Difference]: Finished difference Result 12095 states and 15451 transitions. [2019-10-15 01:24:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:24:43,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-15 01:24:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:44,015 INFO L225 Difference]: With dead ends: 12095 [2019-10-15 01:24:44,015 INFO L226 Difference]: Without dead ends: 7535 [2019-10-15 01:24:44,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:24:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7535 states. [2019-10-15 01:24:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7535 to 6989. [2019-10-15 01:24:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6989 states. [2019-10-15 01:24:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6989 states to 6989 states and 8847 transitions. [2019-10-15 01:24:44,603 INFO L78 Accepts]: Start accepts. Automaton has 6989 states and 8847 transitions. Word has length 139 [2019-10-15 01:24:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:44,603 INFO L462 AbstractCegarLoop]: Abstraction has 6989 states and 8847 transitions. [2019-10-15 01:24:44,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:24:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6989 states and 8847 transitions. [2019-10-15 01:24:44,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:24:44,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:44,608 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:44,608 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:44,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:44,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1241684620, now seen corresponding path program 1 times [2019-10-15 01:24:44,609 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:44,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165901034] [2019-10-15 01:24:44,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:44,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:44,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:44,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165901034] [2019-10-15 01:24:44,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:44,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:44,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579559921] [2019-10-15 01:24:44,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:44,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:44,671 INFO L87 Difference]: Start difference. First operand 6989 states and 8847 transitions. Second operand 3 states. [2019-10-15 01:24:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:45,138 INFO L93 Difference]: Finished difference Result 13457 states and 17105 transitions. [2019-10-15 01:24:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:45,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-15 01:24:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:45,185 INFO L225 Difference]: With dead ends: 13457 [2019-10-15 01:24:45,185 INFO L226 Difference]: Without dead ends: 7058 [2019-10-15 01:24:45,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2019-10-15 01:24:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 6995. [2019-10-15 01:24:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2019-10-15 01:24:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 8853 transitions. [2019-10-15 01:24:46,317 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 8853 transitions. Word has length 140 [2019-10-15 01:24:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:46,318 INFO L462 AbstractCegarLoop]: Abstraction has 6995 states and 8853 transitions. [2019-10-15 01:24:46,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 8853 transitions. [2019-10-15 01:24:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:24:46,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:46,323 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:24:46,323 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1911015683, now seen corresponding path program 1 times [2019-10-15 01:24:46,324 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:46,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796254169] [2019-10-15 01:24:46,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:46,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:46,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 01:24:46,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796254169] [2019-10-15 01:24:46,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:46,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:24:46,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036768727] [2019-10-15 01:24:46,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:24:46,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:24:46,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:46,656 INFO L87 Difference]: Start difference. First operand 6995 states and 8853 transitions. Second operand 12 states.