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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:22:30,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:30,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:30,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:30,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:30,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:30,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:30,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:30,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:30,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:30,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:30,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:30,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:30,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:30,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:30,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:30,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:30,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:30,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:30,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:30,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:30,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:30,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:30,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:30,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:30,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:30,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:30,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:30,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:30,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:30,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:30,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:30,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:30,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:30,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:30,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:30,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:30,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:30,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:30,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:30,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:30,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:22:30,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:30,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:30,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:30,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:30,241 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:30,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:30,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:30,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:30,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:30,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:30,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:30,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:30,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:30,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:30,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:30,244 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:30,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:30,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:30,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:30,245 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:30,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:30,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:30,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:30,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:30,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:30,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:30,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:30,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:30,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:22:30,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:30,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:30,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:30,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:30,584 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:30,585 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-13 23:22:30,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d9b7952/75a7220456e944fd97dd06135b810310/FLAG3dbecf1ab [2019-10-13 23:22:31,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:31,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-13 23:22:31,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d9b7952/75a7220456e944fd97dd06135b810310/FLAG3dbecf1ab [2019-10-13 23:22:31,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d9b7952/75a7220456e944fd97dd06135b810310 [2019-10-13 23:22:31,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:31,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:31,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:31,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:31,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:31,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:31" (1/1) ... [2019-10-13 23:22:31,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e394a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:31, skipping insertion in model container [2019-10-13 23:22:31,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:31" (1/1) ... [2019-10-13 23:22:31,511 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:31,565 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:31,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:31,977 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:32,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:32,085 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:32,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32 WrapperNode [2019-10-13 23:22:32,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:32,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:32,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:32,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:32,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (1/1) ... [2019-10-13 23:22:32,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (1/1) ... [2019-10-13 23:22:32,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (1/1) ... [2019-10-13 23:22:32,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (1/1) ... [2019-10-13 23:22:32,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (1/1) ... [2019-10-13 23:22:32,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (1/1) ... [2019-10-13 23:22:32,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (1/1) ... [2019-10-13 23:22:32,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:32,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:32,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:32,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:32,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:32,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:32,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:32,221 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-13 23:22:32,221 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-13 23:22:32,221 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-13 23:22:32,221 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-13 23:22:32,221 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-13 23:22:32,222 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-13 23:22:32,222 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-13 23:22:32,222 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-13 23:22:32,222 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 23:22:32,222 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-13 23:22:32,223 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-13 23:22:32,223 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-13 23:22:32,223 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-13 23:22:32,223 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-13 23:22:32,223 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 23:22:32,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:32,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 23:22:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:32,224 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-13 23:22:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-13 23:22:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-13 23:22:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-13 23:22:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-13 23:22:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-13 23:22:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-13 23:22:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-13 23:22:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-13 23:22:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-13 23:22:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-13 23:22:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-13 23:22:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-13 23:22:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:32,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:33,639 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:33,640 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:22:33,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:33 BoogieIcfgContainer [2019-10-13 23:22:33,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:33,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:33,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:33,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:33,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:31" (1/3) ... [2019-10-13 23:22:33,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3da0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:33, skipping insertion in model container [2019-10-13 23:22:33,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:32" (2/3) ... [2019-10-13 23:22:33,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3da0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:33, skipping insertion in model container [2019-10-13 23:22:33,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:33" (3/3) ... [2019-10-13 23:22:33,654 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-10-13 23:22:33,667 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:33,680 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:22:33,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:22:33,737 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:33,737 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:33,738 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:33,738 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:33,738 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:33,738 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:33,739 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:33,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2019-10-13 23:22:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:22:33,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:33,785 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] [2019-10-13 23:22:33,788 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1554589373, now seen corresponding path program 1 times [2019-10-13 23:22:33,805 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:33,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792372313] [2019-10-13 23:22:33,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:34,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792372313] [2019-10-13 23:22:34,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:34,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263883490] [2019-10-13 23:22:34,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:34,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:34,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:34,349 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 4 states. [2019-10-13 23:22:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:34,481 INFO L93 Difference]: Finished difference Result 360 states and 550 transitions. [2019-10-13 23:22:34,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:34,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-13 23:22:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:34,497 INFO L225 Difference]: With dead ends: 360 [2019-10-13 23:22:34,498 INFO L226 Difference]: Without dead ends: 185 [2019-10-13 23:22:34,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-13 23:22:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-10-13 23:22:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-13 23:22:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 263 transitions. [2019-10-13 23:22:34,577 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 263 transitions. Word has length 44 [2019-10-13 23:22:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,578 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 263 transitions. [2019-10-13 23:22:34,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 263 transitions. [2019-10-13 23:22:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:34,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,585 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] [2019-10-13 23:22:34,585 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1078758557, now seen corresponding path program 1 times [2019-10-13 23:22:34,588 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287874216] [2019-10-13 23:22:34,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:34,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287874216] [2019-10-13 23:22:34,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:34,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423834658] [2019-10-13 23:22:34,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:34,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:34,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:34,879 INFO L87 Difference]: Start difference. First operand 185 states and 263 transitions. Second operand 7 states. [2019-10-13 23:22:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:36,007 INFO L93 Difference]: Finished difference Result 416 states and 590 transitions. [2019-10-13 23:22:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:22:36,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-13 23:22:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:36,015 INFO L225 Difference]: With dead ends: 416 [2019-10-13 23:22:36,015 INFO L226 Difference]: Without dead ends: 240 [2019-10-13 23:22:36,017 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-13 23:22:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-13 23:22:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-10-13 23:22:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-13 23:22:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2019-10-13 23:22:36,047 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 59 [2019-10-13 23:22:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:36,048 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2019-10-13 23:22:36,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2019-10-13 23:22:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:22:36,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:36,051 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] [2019-10-13 23:22:36,051 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1695939672, now seen corresponding path program 1 times [2019-10-13 23:22:36,052 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:36,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080890554] [2019-10-13 23:22:36,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:36,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080890554] [2019-10-13 23:22:36,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:36,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:36,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312769681] [2019-10-13 23:22:36,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:36,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:36,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:36,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:36,162 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand 7 states. [2019-10-13 23:22:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:37,193 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2019-10-13 23:22:37,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:22:37,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-13 23:22:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:37,196 INFO L225 Difference]: With dead ends: 422 [2019-10-13 23:22:37,197 INFO L226 Difference]: Without dead ends: 243 [2019-10-13 23:22:37,199 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-13 23:22:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-13 23:22:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-10-13 23:22:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-13 23:22:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2019-10-13 23:22:37,258 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 60 [2019-10-13 23:22:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:37,258 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2019-10-13 23:22:37,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2019-10-13 23:22:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:22:37,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:37,263 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] [2019-10-13 23:22:37,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1240740783, now seen corresponding path program 1 times [2019-10-13 23:22:37,268 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:37,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184229232] [2019-10-13 23:22:37,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:37,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184229232] [2019-10-13 23:22:37,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:37,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:37,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871732720] [2019-10-13 23:22:37,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:37,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:37,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:37,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:37,404 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand 5 states. [2019-10-13 23:22:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:37,516 INFO L93 Difference]: Finished difference Result 826 states and 1164 transitions. [2019-10-13 23:22:37,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:37,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-13 23:22:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:37,523 INFO L225 Difference]: With dead ends: 826 [2019-10-13 23:22:37,523 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 23:22:37,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 23:22:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 454. [2019-10-13 23:22:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-13 23:22:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 634 transitions. [2019-10-13 23:22:37,574 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 634 transitions. Word has length 62 [2019-10-13 23:22:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:37,574 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 634 transitions. [2019-10-13 23:22:37,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 634 transitions. [2019-10-13 23:22:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 23:22:37,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:37,578 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] [2019-10-13 23:22:37,578 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:37,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1725288910, now seen corresponding path program 1 times [2019-10-13 23:22:37,579 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:37,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728755336] [2019-10-13 23:22:37,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:37,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728755336] [2019-10-13 23:22:37,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:37,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:37,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704583311] [2019-10-13 23:22:37,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:37,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:37,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:37,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:37,709 INFO L87 Difference]: Start difference. First operand 454 states and 634 transitions. Second operand 4 states. [2019-10-13 23:22:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:37,772 INFO L93 Difference]: Finished difference Result 828 states and 1171 transitions. [2019-10-13 23:22:37,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:37,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-13 23:22:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:37,779 INFO L225 Difference]: With dead ends: 828 [2019-10-13 23:22:37,780 INFO L226 Difference]: Without dead ends: 464 [2019-10-13 23:22:37,782 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-13 23:22:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-13 23:22:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-10-13 23:22:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-10-13 23:22:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 642 transitions. [2019-10-13 23:22:37,864 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 642 transitions. Word has length 64 [2019-10-13 23:22:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:37,865 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 642 transitions. [2019-10-13 23:22:37,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 642 transitions. [2019-10-13 23:22:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 23:22:37,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:37,872 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:37,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:37,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:37,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1712819026, now seen corresponding path program 1 times [2019-10-13 23:22:37,873 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:37,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298122086] [2019-10-13 23:22:37,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:37,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298122086] [2019-10-13 23:22:37,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:37,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:37,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652785343] [2019-10-13 23:22:37,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:37,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:37,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:37,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:37,968 INFO L87 Difference]: Start difference. First operand 464 states and 642 transitions. Second operand 4 states. [2019-10-13 23:22:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,033 INFO L93 Difference]: Finished difference Result 848 states and 1193 transitions. [2019-10-13 23:22:38,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:38,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-10-13 23:22:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,039 INFO L225 Difference]: With dead ends: 848 [2019-10-13 23:22:38,039 INFO L226 Difference]: Without dead ends: 474 [2019-10-13 23:22:38,041 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-13 23:22:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-13 23:22:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-10-13 23:22:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-13 23:22:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 650 transitions. [2019-10-13 23:22:38,079 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 650 transitions. Word has length 72 [2019-10-13 23:22:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,079 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 650 transitions. [2019-10-13 23:22:38,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 650 transitions. [2019-10-13 23:22:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 23:22:38,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,082 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] [2019-10-13 23:22:38,082 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1368606264, now seen corresponding path program 1 times [2019-10-13 23:22:38,083 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432053965] [2019-10-13 23:22:38,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:38,189 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-13 23:22:38,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432053965] [2019-10-13 23:22:38,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:38,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:38,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009989757] [2019-10-13 23:22:38,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:38,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:38,192 INFO L87 Difference]: Start difference. First operand 474 states and 650 transitions. Second operand 4 states. [2019-10-13 23:22:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,253 INFO L93 Difference]: Finished difference Result 866 states and 1201 transitions. [2019-10-13 23:22:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:38,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-13 23:22:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,258 INFO L225 Difference]: With dead ends: 866 [2019-10-13 23:22:38,258 INFO L226 Difference]: Without dead ends: 482 [2019-10-13 23:22:38,260 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-13 23:22:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-13 23:22:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-10-13 23:22:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-13 23:22:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 656 transitions. [2019-10-13 23:22:38,301 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 656 transitions. Word has length 80 [2019-10-13 23:22:38,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,304 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 656 transitions. [2019-10-13 23:22:38,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 656 transitions. [2019-10-13 23:22:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 23:22:38,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,307 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] [2019-10-13 23:22:38,308 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash -361072044, now seen corresponding path program 1 times [2019-10-13 23:22:38,308 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379059415] [2019-10-13 23:22:38,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:38,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379059415] [2019-10-13 23:22:38,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:38,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:38,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739618420] [2019-10-13 23:22:38,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:38,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:38,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:38,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:38,441 INFO L87 Difference]: Start difference. First operand 482 states and 656 transitions. Second operand 4 states. [2019-10-13 23:22:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,508 INFO L93 Difference]: Finished difference Result 884 states and 1221 transitions. [2019-10-13 23:22:38,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:38,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-13 23:22:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,512 INFO L225 Difference]: With dead ends: 884 [2019-10-13 23:22:38,513 INFO L226 Difference]: Without dead ends: 492 [2019-10-13 23:22:38,515 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-13 23:22:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-13 23:22:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2019-10-13 23:22:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-13 23:22:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 664 transitions. [2019-10-13 23:22:38,552 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 664 transitions. Word has length 80 [2019-10-13 23:22:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,553 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 664 transitions. [2019-10-13 23:22:38,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 664 transitions. [2019-10-13 23:22:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 23:22:38,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,562 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] [2019-10-13 23:22:38,563 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash 743854552, now seen corresponding path program 1 times [2019-10-13 23:22:38,564 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278933769] [2019-10-13 23:22:38,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:38,715 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-13 23:22:38,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278933769] [2019-10-13 23:22:38,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:38,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:38,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516042703] [2019-10-13 23:22:38,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:38,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:38,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:38,723 INFO L87 Difference]: Start difference. First operand 492 states and 664 transitions. Second operand 4 states. [2019-10-13 23:22:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,793 INFO L93 Difference]: Finished difference Result 906 states and 1235 transitions. [2019-10-13 23:22:38,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:38,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 23:22:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,797 INFO L225 Difference]: With dead ends: 906 [2019-10-13 23:22:38,798 INFO L226 Difference]: Without dead ends: 504 [2019-10-13 23:22:38,799 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-13 23:22:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-10-13 23:22:38,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-10-13 23:22:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-13 23:22:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 674 transitions. [2019-10-13 23:22:38,833 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 674 transitions. Word has length 88 [2019-10-13 23:22:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,835 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 674 transitions. [2019-10-13 23:22:38,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 674 transitions. [2019-10-13 23:22:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 23:22:38,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,838 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] [2019-10-13 23:22:38,838 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1350881815, now seen corresponding path program 1 times [2019-10-13 23:22:38,839 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833424619] [2019-10-13 23:22:38,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:39,117 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-13 23:22:39,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833424619] [2019-10-13 23:22:39,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:39,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:22:39,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045608878] [2019-10-13 23:22:39,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:22:39,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:39,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:22:39,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:39,119 INFO L87 Difference]: Start difference. First operand 504 states and 674 transitions. Second operand 12 states. [2019-10-13 23:22:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:41,934 INFO L93 Difference]: Finished difference Result 1340 states and 1771 transitions. [2019-10-13 23:22:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:41,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-10-13 23:22:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:41,943 INFO L225 Difference]: With dead ends: 1340 [2019-10-13 23:22:41,943 INFO L226 Difference]: Without dead ends: 920 [2019-10-13 23:22:41,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-10-13 23:22:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 854. [2019-10-13 23:22:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-10-13 23:22:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1118 transitions. [2019-10-13 23:22:42,023 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1118 transitions. Word has length 93 [2019-10-13 23:22:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,024 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1118 transitions. [2019-10-13 23:22:42,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:22:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1118 transitions. [2019-10-13 23:22:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 23:22:42,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,027 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] [2019-10-13 23:22:42,028 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,028 INFO L82 PathProgramCache]: Analyzing trace with hash -590163429, now seen corresponding path program 1 times [2019-10-13 23:22:42,029 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302253031] [2019-10-13 23:22:42,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,134 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-13 23:22:42,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302253031] [2019-10-13 23:22:42,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:42,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955807216] [2019-10-13 23:22:42,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:42,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:42,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:42,137 INFO L87 Difference]: Start difference. First operand 854 states and 1118 transitions. Second operand 4 states. [2019-10-13 23:22:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,202 INFO L93 Difference]: Finished difference Result 1562 states and 2055 transitions. [2019-10-13 23:22:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:42,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-13 23:22:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,210 INFO L225 Difference]: With dead ends: 1562 [2019-10-13 23:22:42,216 INFO L226 Difference]: Without dead ends: 862 [2019-10-13 23:22:42,219 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-13 23:22:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-13 23:22:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2019-10-13 23:22:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-10-13 23:22:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1114 transitions. [2019-10-13 23:22:42,272 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1114 transitions. Word has length 95 [2019-10-13 23:22:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,272 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1114 transitions. [2019-10-13 23:22:42,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1114 transitions. [2019-10-13 23:22:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 23:22:42,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,274 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] [2019-10-13 23:22:42,274 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash -272810448, now seen corresponding path program 1 times [2019-10-13 23:22:42,275 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711434244] [2019-10-13 23:22:42,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:22:42,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711434244] [2019-10-13 23:22:42,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:42,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630193120] [2019-10-13 23:22:42,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:42,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:42,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:42,367 INFO L87 Difference]: Start difference. First operand 862 states and 1114 transitions. Second operand 4 states. [2019-10-13 23:22:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,425 INFO L93 Difference]: Finished difference Result 1528 states and 1981 transitions. [2019-10-13 23:22:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:42,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-13 23:22:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,433 INFO L225 Difference]: With dead ends: 1528 [2019-10-13 23:22:42,434 INFO L226 Difference]: Without dead ends: 854 [2019-10-13 23:22:42,437 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-13 23:22:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-10-13 23:22:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2019-10-13 23:22:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-10-13 23:22:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1090 transitions. [2019-10-13 23:22:42,491 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1090 transitions. Word has length 97 [2019-10-13 23:22:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,492 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1090 transitions. [2019-10-13 23:22:42,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1090 transitions. [2019-10-13 23:22:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 23:22:42,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,494 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] [2019-10-13 23:22:42,494 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 564471986, now seen corresponding path program 1 times [2019-10-13 23:22:42,495 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5487943] [2019-10-13 23:22:42,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,632 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-13 23:22:42,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5487943] [2019-10-13 23:22:42,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:42,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894791366] [2019-10-13 23:22:42,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:42,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:42,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:42,635 INFO L87 Difference]: Start difference. First operand 854 states and 1090 transitions. Second operand 7 states. [2019-10-13 23:22:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,726 INFO L93 Difference]: Finished difference Result 912 states and 1174 transitions. [2019-10-13 23:22:42,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:22:42,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-13 23:22:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,731 INFO L225 Difference]: With dead ends: 912 [2019-10-13 23:22:42,732 INFO L226 Difference]: Without dead ends: 910 [2019-10-13 23:22:42,732 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-13 23:22:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-10-13 23:22:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 874. [2019-10-13 23:22:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-10-13 23:22:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1112 transitions. [2019-10-13 23:22:42,781 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1112 transitions. Word has length 96 [2019-10-13 23:22:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,781 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1112 transitions. [2019-10-13 23:22:42,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1112 transitions. [2019-10-13 23:22:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 23:22:42,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,783 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] [2019-10-13 23:22:42,783 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1749399501, now seen corresponding path program 1 times [2019-10-13 23:22:42,784 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767401533] [2019-10-13 23:22:42,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,979 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-13 23:22:42,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767401533] [2019-10-13 23:22:42,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:22:42,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765617975] [2019-10-13 23:22:42,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:22:42,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:22:42,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:42,981 INFO L87 Difference]: Start difference. First operand 874 states and 1112 transitions. Second operand 12 states. [2019-10-13 23:22:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:46,135 INFO L93 Difference]: Finished difference Result 2474 states and 3108 transitions. [2019-10-13 23:22:46,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:46,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-13 23:22:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:46,145 INFO L225 Difference]: With dead ends: 2474 [2019-10-13 23:22:46,146 INFO L226 Difference]: Without dead ends: 1788 [2019-10-13 23:22:46,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-10-13 23:22:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1399. [2019-10-13 23:22:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2019-10-13 23:22:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1766 transitions. [2019-10-13 23:22:46,229 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1766 transitions. Word has length 101 [2019-10-13 23:22:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:46,229 INFO L462 AbstractCegarLoop]: Abstraction has 1399 states and 1766 transitions. [2019-10-13 23:22:46,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:22:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1766 transitions. [2019-10-13 23:22:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:46,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:46,232 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] [2019-10-13 23:22:46,233 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1967235009, now seen corresponding path program 1 times [2019-10-13 23:22:46,233 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:46,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912455570] [2019-10-13 23:22:46,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:46,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:46,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:46,518 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-13 23:22:46,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912455570] [2019-10-13 23:22:46,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:46,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:46,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401258108] [2019-10-13 23:22:46,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:46,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:46,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:46,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:46,522 INFO L87 Difference]: Start difference. First operand 1399 states and 1766 transitions. Second operand 9 states. [2019-10-13 23:22:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:47,835 INFO L93 Difference]: Finished difference Result 3412 states and 4357 transitions. [2019-10-13 23:22:47,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:47,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-13 23:22:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:47,850 INFO L225 Difference]: With dead ends: 3412 [2019-10-13 23:22:47,851 INFO L226 Difference]: Without dead ends: 2220 [2019-10-13 23:22:47,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:22:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-10-13 23:22:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1961. [2019-10-13 23:22:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-10-13 23:22:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2468 transitions. [2019-10-13 23:22:47,973 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2468 transitions. Word has length 102 [2019-10-13 23:22:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:47,973 INFO L462 AbstractCegarLoop]: Abstraction has 1961 states and 2468 transitions. [2019-10-13 23:22:47,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2468 transitions. [2019-10-13 23:22:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:47,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:47,976 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] [2019-10-13 23:22:47,976 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1053485956, now seen corresponding path program 1 times [2019-10-13 23:22:47,977 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:47,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443827111] [2019-10-13 23:22:47,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:47,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:47,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:48,054 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-13 23:22:48,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443827111] [2019-10-13 23:22:48,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:48,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:48,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712830614] [2019-10-13 23:22:48,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:48,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:48,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:48,061 INFO L87 Difference]: Start difference. First operand 1961 states and 2468 transitions. Second operand 5 states. [2019-10-13 23:22:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:48,566 INFO L93 Difference]: Finished difference Result 6105 states and 7758 transitions. [2019-10-13 23:22:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:48,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 23:22:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:48,590 INFO L225 Difference]: With dead ends: 6105 [2019-10-13 23:22:48,590 INFO L226 Difference]: Without dead ends: 4396 [2019-10-13 23:22:48,599 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-13 23:22:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2019-10-13 23:22:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 4052. [2019-10-13 23:22:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4052 states. [2019-10-13 23:22:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 5124 transitions. [2019-10-13 23:22:48,926 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 5124 transitions. Word has length 102 [2019-10-13 23:22:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:48,926 INFO L462 AbstractCegarLoop]: Abstraction has 4052 states and 5124 transitions. [2019-10-13 23:22:48,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 5124 transitions. [2019-10-13 23:22:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 23:22:48,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:48,930 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] [2019-10-13 23:22:48,930 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 822083386, now seen corresponding path program 1 times [2019-10-13 23:22:48,931 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:48,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057480103] [2019-10-13 23:22:48,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:48,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:48,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:49,103 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-13 23:22:49,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057480103] [2019-10-13 23:22:49,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:49,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:49,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041279474] [2019-10-13 23:22:49,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:49,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:49,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:49,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:49,106 INFO L87 Difference]: Start difference. First operand 4052 states and 5124 transitions. Second operand 9 states. [2019-10-13 23:22:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:50,386 INFO L93 Difference]: Finished difference Result 7670 states and 9786 transitions. [2019-10-13 23:22:50,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:50,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-13 23:22:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:50,409 INFO L225 Difference]: With dead ends: 7670 [2019-10-13 23:22:50,409 INFO L226 Difference]: Without dead ends: 4133 [2019-10-13 23:22:50,421 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-13 23:22:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2019-10-13 23:22:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 3639. [2019-10-13 23:22:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2019-10-13 23:22:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4579 transitions. [2019-10-13 23:22:50,688 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4579 transitions. Word has length 104 [2019-10-13 23:22:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:50,690 INFO L462 AbstractCegarLoop]: Abstraction has 3639 states and 4579 transitions. [2019-10-13 23:22:50,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4579 transitions. [2019-10-13 23:22:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 23:22:50,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:50,693 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-13 23:22:50,694 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1741111612, now seen corresponding path program 1 times [2019-10-13 23:22:50,694 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:50,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614276018] [2019-10-13 23:22:50,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 23:22:50,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614276018] [2019-10-13 23:22:50,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:50,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:50,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419438673] [2019-10-13 23:22:50,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:50,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:50,789 INFO L87 Difference]: Start difference. First operand 3639 states and 4579 transitions. Second operand 4 states. [2019-10-13 23:22:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:50,958 INFO L93 Difference]: Finished difference Result 6778 states and 8592 transitions. [2019-10-13 23:22:50,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:50,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 23:22:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:50,977 INFO L225 Difference]: With dead ends: 6778 [2019-10-13 23:22:50,978 INFO L226 Difference]: Without dead ends: 3581 [2019-10-13 23:22:50,988 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-13 23:22:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2019-10-13 23:22:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3581. [2019-10-13 23:22:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3581 states. [2019-10-13 23:22:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 4405 transitions. [2019-10-13 23:22:51,167 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 4405 transitions. Word has length 106 [2019-10-13 23:22:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:51,167 INFO L462 AbstractCegarLoop]: Abstraction has 3581 states and 4405 transitions. [2019-10-13 23:22:51,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 4405 transitions. [2019-10-13 23:22:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 23:22:51,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:51,177 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] [2019-10-13 23:22:51,177 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash 317418295, now seen corresponding path program 1 times [2019-10-13 23:22:51,178 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:51,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615503762] [2019-10-13 23:22:51,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:51,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:51,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:51,243 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-13 23:22:51,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615503762] [2019-10-13 23:22:51,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:51,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:51,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010303249] [2019-10-13 23:22:51,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:51,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:51,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:51,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:51,246 INFO L87 Difference]: Start difference. First operand 3581 states and 4405 transitions. Second operand 5 states. [2019-10-13 23:22:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:52,009 INFO L93 Difference]: Finished difference Result 10843 states and 13339 transitions. [2019-10-13 23:22:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:52,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 23:22:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:52,059 INFO L225 Difference]: With dead ends: 10843 [2019-10-13 23:22:52,060 INFO L226 Difference]: Without dead ends: 7777 [2019-10-13 23:22:52,070 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-13 23:22:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7777 states. [2019-10-13 23:22:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7777 to 6122. [2019-10-13 23:22:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6122 states. [2019-10-13 23:22:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6122 states to 6122 states and 7525 transitions. [2019-10-13 23:22:52,381 INFO L78 Accepts]: Start accepts. Automaton has 6122 states and 7525 transitions. Word has length 106 [2019-10-13 23:22:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:52,381 INFO L462 AbstractCegarLoop]: Abstraction has 6122 states and 7525 transitions. [2019-10-13 23:22:52,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 6122 states and 7525 transitions. [2019-10-13 23:22:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 23:22:52,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:52,385 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] [2019-10-13 23:22:52,385 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:52,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:52,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1612477254, now seen corresponding path program 1 times [2019-10-13 23:22:52,386 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:52,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223095389] [2019-10-13 23:22:52,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:52,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:52,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:52,455 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-13 23:22:52,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223095389] [2019-10-13 23:22:52,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:52,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:52,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504102093] [2019-10-13 23:22:52,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:52,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:52,457 INFO L87 Difference]: Start difference. First operand 6122 states and 7525 transitions. Second operand 5 states. [2019-10-13 23:22:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:53,124 INFO L93 Difference]: Finished difference Result 14100 states and 17318 transitions. [2019-10-13 23:22:53,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:53,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 23:22:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:53,167 INFO L225 Difference]: With dead ends: 14100 [2019-10-13 23:22:53,167 INFO L226 Difference]: Without dead ends: 8710 [2019-10-13 23:22:53,183 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-13 23:22:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-10-13 23:22:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 8358. [2019-10-13 23:22:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8358 states. [2019-10-13 23:22:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 10251 transitions. [2019-10-13 23:22:53,537 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 10251 transitions. Word has length 106 [2019-10-13 23:22:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:53,538 INFO L462 AbstractCegarLoop]: Abstraction has 8358 states and 10251 transitions. [2019-10-13 23:22:53,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 10251 transitions. [2019-10-13 23:22:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 23:22:53,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:53,542 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] [2019-10-13 23:22:53,542 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:53,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1928416921, now seen corresponding path program 1 times [2019-10-13 23:22:53,543 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:53,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108968999] [2019-10-13 23:22:53,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:53,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:53,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:53,600 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-13 23:22:53,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108968999] [2019-10-13 23:22:53,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:53,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:53,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201823075] [2019-10-13 23:22:53,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:53,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:53,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:53,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:53,603 INFO L87 Difference]: Start difference. First operand 8358 states and 10251 transitions. Second operand 3 states. [2019-10-13 23:22:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:54,016 INFO L93 Difference]: Finished difference Result 15994 states and 19556 transitions. [2019-10-13 23:22:54,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:54,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-13 23:22:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:54,050 INFO L225 Difference]: With dead ends: 15994 [2019-10-13 23:22:54,051 INFO L226 Difference]: Without dead ends: 8397 [2019-10-13 23:22:54,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8397 states. [2019-10-13 23:22:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8397 to 8364. [2019-10-13 23:22:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8364 states. [2019-10-13 23:22:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8364 states to 8364 states and 10257 transitions. [2019-10-13 23:22:54,464 INFO L78 Accepts]: Start accepts. Automaton has 8364 states and 10257 transitions. Word has length 107 [2019-10-13 23:22:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:54,465 INFO L462 AbstractCegarLoop]: Abstraction has 8364 states and 10257 transitions. [2019-10-13 23:22:54,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 8364 states and 10257 transitions. [2019-10-13 23:22:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 23:22:54,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:54,470 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] [2019-10-13 23:22:54,470 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2043218370, now seen corresponding path program 1 times [2019-10-13 23:22:54,470 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:54,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969595736] [2019-10-13 23:22:54,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:54,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:54,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:54,817 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-13 23:22:54,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969595736] [2019-10-13 23:22:54,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:54,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:54,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300120877] [2019-10-13 23:22:54,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:54,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:54,819 INFO L87 Difference]: Start difference. First operand 8364 states and 10257 transitions. Second operand 9 states. [2019-10-13 23:22:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:56,285 INFO L93 Difference]: Finished difference Result 15918 states and 19435 transitions. [2019-10-13 23:22:56,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:22:56,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-10-13 23:22:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:56,314 INFO L225 Difference]: With dead ends: 15918 [2019-10-13 23:22:56,314 INFO L226 Difference]: Without dead ends: 7752 [2019-10-13 23:22:56,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:22:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2019-10-13 23:22:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 7005. [2019-10-13 23:22:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7005 states. [2019-10-13 23:22:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 8523 transitions. [2019-10-13 23:22:57,341 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 8523 transitions. Word has length 108 [2019-10-13 23:22:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:57,342 INFO L462 AbstractCegarLoop]: Abstraction has 7005 states and 8523 transitions. [2019-10-13 23:22:57,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 8523 transitions. [2019-10-13 23:22:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 23:22:57,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:57,344 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] [2019-10-13 23:22:57,345 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:57,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:57,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1292914891, now seen corresponding path program 1 times [2019-10-13 23:22:57,345 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:57,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062184255] [2019-10-13 23:22:57,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:57,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:57,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:57,400 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-13 23:22:57,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062184255] [2019-10-13 23:22:57,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:57,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:57,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11285436] [2019-10-13 23:22:57,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:57,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:57,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:57,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:57,404 INFO L87 Difference]: Start difference. First operand 7005 states and 8523 transitions. Second operand 3 states. [2019-10-13 23:22:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:57,702 INFO L93 Difference]: Finished difference Result 13744 states and 16706 transitions. [2019-10-13 23:22:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:57,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-13 23:22:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:57,731 INFO L225 Difference]: With dead ends: 13744 [2019-10-13 23:22:57,731 INFO L226 Difference]: Without dead ends: 7047 [2019-10-13 23:22:57,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2019-10-13 23:22:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 7011. [2019-10-13 23:22:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7011 states. [2019-10-13 23:22:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7011 states to 7011 states and 8529 transitions. [2019-10-13 23:22:58,152 INFO L78 Accepts]: Start accepts. Automaton has 7011 states and 8529 transitions. Word has length 109 [2019-10-13 23:22:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:58,152 INFO L462 AbstractCegarLoop]: Abstraction has 7011 states and 8529 transitions. [2019-10-13 23:22:58,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 7011 states and 8529 transitions. [2019-10-13 23:22:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 23:22:58,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:58,155 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] [2019-10-13 23:22:58,155 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:58,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1009964240, now seen corresponding path program 1 times [2019-10-13 23:22:58,156 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:58,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543726613] [2019-10-13 23:22:58,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:58,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:58,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:58,328 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-13 23:22:58,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543726613] [2019-10-13 23:22:58,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:58,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:22:58,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961595548] [2019-10-13 23:22:58,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:22:58,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:22:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:58,331 INFO L87 Difference]: Start difference. First operand 7011 states and 8529 transitions. Second operand 8 states. [2019-10-13 23:22:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:59,704 INFO L93 Difference]: Finished difference Result 13754 states and 16703 transitions. [2019-10-13 23:22:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:22:59,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2019-10-13 23:22:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:59,732 INFO L225 Difference]: With dead ends: 13754 [2019-10-13 23:22:59,732 INFO L226 Difference]: Without dead ends: 7049 [2019-10-13 23:22:59,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:22:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7049 states. [2019-10-13 23:23:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7049 to 6851. [2019-10-13 23:23:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6851 states. [2019-10-13 23:23:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 8319 transitions. [2019-10-13 23:23:00,149 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 8319 transitions. Word has length 109 [2019-10-13 23:23:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:23:00,150 INFO L462 AbstractCegarLoop]: Abstraction has 6851 states and 8319 transitions. [2019-10-13 23:23:00,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:23:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 8319 transitions. [2019-10-13 23:23:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 23:23:00,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:23:00,152 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] [2019-10-13 23:23:00,152 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:23:00,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:23:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2035407738, now seen corresponding path program 1 times [2019-10-13 23:23:00,153 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:23:00,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179472374] [2019-10-13 23:23:00,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:00,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:00,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:23:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:23:00,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-13 23:23:00,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179472374] [2019-10-13 23:23:00,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:23:00,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:23:00,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661864076] [2019-10-13 23:23:00,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:23:00,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:23:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:23:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:23:00,206 INFO L87 Difference]: Start difference. First operand 6851 states and 8319 transitions. Second operand 4 states. [2019-10-13 23:23:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:23:00,486 INFO L93 Difference]: Finished difference Result 13242 states and 16033 transitions. [2019-10-13 23:23:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:23:00,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-13 23:23:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:23:00,509 INFO L225 Difference]: With dead ends: 13242 [2019-10-13 23:23:00,510 INFO L226 Difference]: Without dead ends: 6695 [2019-10-13 23:23:00,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:23:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6695 states. [2019-10-13 23:23:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6695 to 6336. [2019-10-13 23:23:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6336 states. [2019-10-13 23:23:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 7675 transitions. [2019-10-13 23:23:01,001 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 7675 transitions. Word has length 110 [2019-10-13 23:23:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:23:01,002 INFO L462 AbstractCegarLoop]: Abstraction has 6336 states and 7675 transitions. [2019-10-13 23:23:01,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:23:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 7675 transitions. [2019-10-13 23:23:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 23:23:01,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:23:01,006 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2019-10-13 23:23:01,006 INFO L410 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:23:01,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:23:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -845784574, now seen corresponding path program 1 times [2019-10-13 23:23:01,007 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:23:01,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993705257] [2019-10-13 23:23:01,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:01,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:01,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:23:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:23:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-13 23:23:01,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993705257] [2019-10-13 23:23:01,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:23:01,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:23:01,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686229770] [2019-10-13 23:23:01,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:23:01,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:23:01,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:23:01,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:23:01,091 INFO L87 Difference]: Start difference. First operand 6336 states and 7675 transitions. Second operand 4 states. [2019-10-13 23:23:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:23:01,459 INFO L93 Difference]: Finished difference Result 12269 states and 14985 transitions. [2019-10-13 23:23:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:23:01,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-13 23:23:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:23:01,477 INFO L225 Difference]: With dead ends: 12269 [2019-10-13 23:23:01,477 INFO L226 Difference]: Without dead ends: 6216 [2019-10-13 23:23:01,487 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-13 23:23:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6216 states. [2019-10-13 23:23:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6216 to 5838. [2019-10-13 23:23:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5838 states. [2019-10-13 23:23:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 6835 transitions. [2019-10-13 23:23:01,799 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 6835 transitions. Word has length 122 [2019-10-13 23:23:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:23:01,800 INFO L462 AbstractCegarLoop]: Abstraction has 5838 states and 6835 transitions. [2019-10-13 23:23:01,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:23:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 6835 transitions. [2019-10-13 23:23:01,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 23:23:01,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:23:01,803 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 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] [2019-10-13 23:23:01,803 INFO L410 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:23:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:23:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash -371490920, now seen corresponding path program 1 times [2019-10-13 23:23:01,804 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:23:01,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420164383] [2019-10-13 23:23:01,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:01,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:01,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:23:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:23:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-13 23:23:01,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420164383] [2019-10-13 23:23:01,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:23:01,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:23:01,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965144108] [2019-10-13 23:23:01,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:23:01,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:23:01,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:23:01,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:23:01,881 INFO L87 Difference]: Start difference. First operand 5838 states and 6835 transitions. Second operand 4 states. [2019-10-13 23:23:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:23:02,168 INFO L93 Difference]: Finished difference Result 11235 states and 13191 transitions. [2019-10-13 23:23:02,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:23:02,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 23:23:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:23:02,185 INFO L225 Difference]: With dead ends: 11235 [2019-10-13 23:23:02,186 INFO L226 Difference]: Without dead ends: 5700 [2019-10-13 23:23:02,193 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-13 23:23:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-10-13 23:23:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5296. [2019-10-13 23:23:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2019-10-13 23:23:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 6026 transitions. [2019-10-13 23:23:02,444 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 6026 transitions. Word has length 138 [2019-10-13 23:23:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:23:02,444 INFO L462 AbstractCegarLoop]: Abstraction has 5296 states and 6026 transitions. [2019-10-13 23:23:02,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:23:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 6026 transitions. [2019-10-13 23:23:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 23:23:02,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:23:02,448 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2019-10-13 23:23:02,448 INFO L410 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:23:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:23:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1627825050, now seen corresponding path program 1 times [2019-10-13 23:23:02,449 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:23:02,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719693424] [2019-10-13 23:23:02,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:02,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:02,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:23:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:23:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-13 23:23:02,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719693424] [2019-10-13 23:23:02,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159593017] [2019-10-13 23:23:02,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:23:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:23:02,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 23:23:02,831 INFO L279 TraceCheckSpWp]: Computing forward predicates...