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_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:22:28,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:28,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:28,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:28,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:28,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:28,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:28,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:28,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:28,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:28,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:28,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:28,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:28,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:28,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:28,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:28,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:28,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:28,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:28,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:28,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:28,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:28,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:28,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:28,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:28,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:28,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:28,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:28,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:28,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:28,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:28,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:28,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:28,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:28,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:28,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:28,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:28,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:28,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:28,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:28,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:28,233 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:28,247 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:28,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:28,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:28,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:28,249 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:28,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:28,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:28,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:28,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:28,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:28,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:28,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:28,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:28,251 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:28,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:28,251 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:28,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:28,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:28,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:28,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:28,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:28,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:28,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:28,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:28,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:28,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:28,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:28,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:28,254 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:28,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:28,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:28,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:28,600 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:28,600 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:28,601 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_1.ufo.BOUNDED-10.pals.c [2019-10-13 23:22:28,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5614fc1/ff1493287036428898e5f7697b84eb9d/FLAG8f6852b8a [2019-10-13 23:22:29,182 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:29,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-13 23:22:29,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5614fc1/ff1493287036428898e5f7697b84eb9d/FLAG8f6852b8a [2019-10-13 23:22:29,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5614fc1/ff1493287036428898e5f7697b84eb9d [2019-10-13 23:22:29,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:29,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:29,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:29,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:29,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:29,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:29" (1/1) ... [2019-10-13 23:22:29,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1dcce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:29, skipping insertion in model container [2019-10-13 23:22:29,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:29" (1/1) ... [2019-10-13 23:22:29,582 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:29,655 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:30,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:30,124 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:30,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:30,268 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:30,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30 WrapperNode [2019-10-13 23:22:30,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:30,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:30,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:30,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:30,281 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:30" (1/1) ... [2019-10-13 23:22:30,282 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:30" (1/1) ... [2019-10-13 23:22:30,295 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:30" (1/1) ... [2019-10-13 23:22:30,296 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:30" (1/1) ... [2019-10-13 23:22:30,321 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:30" (1/1) ... [2019-10-13 23:22:30,335 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:30" (1/1) ... [2019-10-13 23:22:30,340 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:30" (1/1) ... [2019-10-13 23:22:30,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:30,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:30,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:30,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:30,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (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:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-13 23:22:30,411 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-13 23:22:30,411 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-13 23:22:30,412 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-13 23:22:30,412 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-13 23:22:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-13 23:22:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-13 23:22:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-13 23:22:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 23:22:30,414 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-13 23:22:30,414 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-13 23:22:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-13 23:22:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-13 23:22:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-13 23:22:30,417 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 23:22:30,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:30,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 23:22:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-13 23:22:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-13 23:22:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-13 23:22:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-13 23:22:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-13 23:22:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-13 23:22:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-13 23:22:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-13 23:22:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-13 23:22:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-13 23:22:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-13 23:22:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-13 23:22:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-13 23:22:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:31,780 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:31,782 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:22:31,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:31 BoogieIcfgContainer [2019-10-13 23:22:31,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:31,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:31,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:31,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:31,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:29" (1/3) ... [2019-10-13 23:22:31,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e655d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:31, skipping insertion in model container [2019-10-13 23:22:31,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (2/3) ... [2019-10-13 23:22:31,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e655d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:31, skipping insertion in model container [2019-10-13 23:22:31,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:31" (3/3) ... [2019-10-13 23:22:31,795 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-13 23:22:31,807 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:31,818 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:22:31,834 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:22:31,875 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:31,876 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:31,876 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:31,876 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:31,877 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:31,877 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:31,877 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:31,877 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2019-10-13 23:22:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:22:31,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:31,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:31,927 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:31,934 INFO L82 PathProgramCache]: Analyzing trace with hash -625438079, now seen corresponding path program 1 times [2019-10-13 23:22:31,943 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:31,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481960652] [2019-10-13 23:22:31,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:31,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:31,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:32,451 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:32,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481960652] [2019-10-13 23:22:32,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:32,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:32,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115767154] [2019-10-13 23:22:32,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:32,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:32,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:32,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:32,477 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 4 states. [2019-10-13 23:22:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:32,618 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2019-10-13 23:22:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:32,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-13 23:22:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:32,647 INFO L225 Difference]: With dead ends: 355 [2019-10-13 23:22:32,647 INFO L226 Difference]: Without dead ends: 181 [2019-10-13 23:22:32,662 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:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-13 23:22:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-10-13 23:22:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-13 23:22:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2019-10-13 23:22:32,782 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 44 [2019-10-13 23:22:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:32,783 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2019-10-13 23:22:32,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2019-10-13 23:22:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:32,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:32,789 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] [2019-10-13 23:22:32,789 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash 478066743, now seen corresponding path program 1 times [2019-10-13 23:22:32,791 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:32,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013205296] [2019-10-13 23:22:32,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:32,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:33,008 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:33,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013205296] [2019-10-13 23:22:33,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:33,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:33,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642556940] [2019-10-13 23:22:33,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:33,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:33,018 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand 5 states. [2019-10-13 23:22:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:33,179 INFO L93 Difference]: Finished difference Result 693 states and 980 transitions. [2019-10-13 23:22:33,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:33,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-13 23:22:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,189 INFO L225 Difference]: With dead ends: 693 [2019-10-13 23:22:33,190 INFO L226 Difference]: Without dead ends: 503 [2019-10-13 23:22:33,192 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:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-10-13 23:22:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 359. [2019-10-13 23:22:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-13 23:22:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 506 transitions. [2019-10-13 23:22:33,289 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 506 transitions. Word has length 58 [2019-10-13 23:22:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:33,290 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 506 transitions. [2019-10-13 23:22:33,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2019-10-13 23:22:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:22:33,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:33,293 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:33,293 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash -226555182, now seen corresponding path program 1 times [2019-10-13 23:22:33,294 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:33,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956625879] [2019-10-13 23:22:33,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:33,411 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:33,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956625879] [2019-10-13 23:22:33,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:33,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:33,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098190620] [2019-10-13 23:22:33,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:33,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:33,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:33,414 INFO L87 Difference]: Start difference. First operand 359 states and 506 transitions. Second operand 4 states. [2019-10-13 23:22:33,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:33,502 INFO L93 Difference]: Finished difference Result 719 states and 1019 transitions. [2019-10-13 23:22:33,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:33,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-13 23:22:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,510 INFO L225 Difference]: With dead ends: 719 [2019-10-13 23:22:33,510 INFO L226 Difference]: Without dead ends: 369 [2019-10-13 23:22:33,514 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:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-13 23:22:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2019-10-13 23:22:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-10-13 23:22:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 514 transitions. [2019-10-13 23:22:33,555 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 514 transitions. Word has length 60 [2019-10-13 23:22:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:33,558 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 514 transitions. [2019-10-13 23:22:33,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 514 transitions. [2019-10-13 23:22:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 23:22:33,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:33,566 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] [2019-10-13 23:22:33,566 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash -922435534, now seen corresponding path program 1 times [2019-10-13 23:22:33,567 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:33,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155080117] [2019-10-13 23:22:33,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:33,681 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:33,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155080117] [2019-10-13 23:22:33,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:33,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:33,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624446503] [2019-10-13 23:22:33,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:33,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:33,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:33,683 INFO L87 Difference]: Start difference. First operand 369 states and 514 transitions. Second operand 4 states. [2019-10-13 23:22:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:33,755 INFO L93 Difference]: Finished difference Result 739 states and 1041 transitions. [2019-10-13 23:22:33,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:33,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-13 23:22:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,764 INFO L225 Difference]: With dead ends: 739 [2019-10-13 23:22:33,764 INFO L226 Difference]: Without dead ends: 379 [2019-10-13 23:22:33,766 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:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-10-13 23:22:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-10-13 23:22:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-13 23:22:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 522 transitions. [2019-10-13 23:22:33,797 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 522 transitions. Word has length 68 [2019-10-13 23:22:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:33,797 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 522 transitions. [2019-10-13 23:22:33,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 522 transitions. [2019-10-13 23:22:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:22:33,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:33,799 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] [2019-10-13 23:22:33,800 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash -215473092, now seen corresponding path program 1 times [2019-10-13 23:22:33,801 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:33,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514003882] [2019-10-13 23:22:33,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:33,906 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:33,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514003882] [2019-10-13 23:22:33,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:33,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:33,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233359680] [2019-10-13 23:22:33,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:33,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:33,912 INFO L87 Difference]: Start difference. First operand 379 states and 522 transitions. Second operand 4 states. [2019-10-13 23:22:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:33,970 INFO L93 Difference]: Finished difference Result 757 states and 1049 transitions. [2019-10-13 23:22:33,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:33,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 23:22:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,974 INFO L225 Difference]: With dead ends: 757 [2019-10-13 23:22:33,975 INFO L226 Difference]: Without dead ends: 387 [2019-10-13 23:22:33,977 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:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-10-13 23:22:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2019-10-13 23:22:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-10-13 23:22:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 528 transitions. [2019-10-13 23:22:33,999 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 528 transitions. Word has length 76 [2019-10-13 23:22:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:33,999 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 528 transitions. [2019-10-13 23:22:33,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 528 transitions. [2019-10-13 23:22:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:22:34,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,001 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:34,002 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,002 INFO L82 PathProgramCache]: Analyzing trace with hash -91522216, now seen corresponding path program 1 times [2019-10-13 23:22:34,002 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492993758] [2019-10-13 23:22:34,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,111 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,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492993758] [2019-10-13 23:22:34,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:34,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56881671] [2019-10-13 23:22:34,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:34,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:34,114 INFO L87 Difference]: Start difference. First operand 387 states and 528 transitions. Second operand 4 states. [2019-10-13 23:22:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:34,176 INFO L93 Difference]: Finished difference Result 775 states and 1069 transitions. [2019-10-13 23:22:34,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:34,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 23:22:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:34,180 INFO L225 Difference]: With dead ends: 775 [2019-10-13 23:22:34,181 INFO L226 Difference]: Without dead ends: 397 [2019-10-13 23:22:34,183 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:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-13 23:22:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-10-13 23:22:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-13 23:22:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 536 transitions. [2019-10-13 23:22:34,204 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 536 transitions. Word has length 76 [2019-10-13 23:22:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,205 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 536 transitions. [2019-10-13 23:22:34,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 536 transitions. [2019-10-13 23:22:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-13 23:22:34,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,207 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] [2019-10-13 23:22:34,207 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1911112284, now seen corresponding path program 1 times [2019-10-13 23:22:34,208 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321712618] [2019-10-13 23:22:34,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,314 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:34,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321712618] [2019-10-13 23:22:34,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:34,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314405336] [2019-10-13 23:22:34,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:34,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:34,317 INFO L87 Difference]: Start difference. First operand 397 states and 536 transitions. Second operand 4 states. [2019-10-13 23:22:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:34,373 INFO L93 Difference]: Finished difference Result 797 states and 1083 transitions. [2019-10-13 23:22:34,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:34,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-13 23:22:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:34,377 INFO L225 Difference]: With dead ends: 797 [2019-10-13 23:22:34,378 INFO L226 Difference]: Without dead ends: 409 [2019-10-13 23:22:34,379 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:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-13 23:22:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-13 23:22:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-13 23:22:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 546 transitions. [2019-10-13 23:22:34,399 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 546 transitions. Word has length 84 [2019-10-13 23:22:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,400 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 546 transitions. [2019-10-13 23:22:34,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 546 transitions. [2019-10-13 23:22:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 23:22:34,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,402 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] [2019-10-13 23:22:34,403 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1631233981, now seen corresponding path program 1 times [2019-10-13 23:22:34,403 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707215001] [2019-10-13 23:22:34,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,680 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:34,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707215001] [2019-10-13 23:22:34,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:22:34,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022213527] [2019-10-13 23:22:34,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:22:34,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:22:34,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:34,683 INFO L87 Difference]: Start difference. First operand 409 states and 546 transitions. Second operand 12 states. [2019-10-13 23:22:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:37,540 INFO L93 Difference]: Finished difference Result 1292 states and 1697 transitions. [2019-10-13 23:22:37,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:37,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-10-13 23:22:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:37,546 INFO L225 Difference]: With dead ends: 1292 [2019-10-13 23:22:37,546 INFO L226 Difference]: Without dead ends: 892 [2019-10-13 23:22:37,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-10-13 23:22:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 828. [2019-10-13 23:22:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-10-13 23:22:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1082 transitions. [2019-10-13 23:22:37,590 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1082 transitions. Word has length 89 [2019-10-13 23:22:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:37,591 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1082 transitions. [2019-10-13 23:22:37,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:22:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1082 transitions. [2019-10-13 23:22:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 23:22:37,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:37,593 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] [2019-10-13 23:22:37,593 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:37,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1764502076, now seen corresponding path program 1 times [2019-10-13 23:22:37,594 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:37,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978670523] [2019-10-13 23:22:37,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:37,680 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:37,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978670523] [2019-10-13 23:22:37,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:37,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:37,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890691165] [2019-10-13 23:22:37,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:37,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:37,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:37,689 INFO L87 Difference]: Start difference. First operand 828 states and 1082 transitions. Second operand 4 states. [2019-10-13 23:22:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:37,765 INFO L93 Difference]: Finished difference Result 1528 states and 2003 transitions. [2019-10-13 23:22:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:37,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 23:22:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:37,771 INFO L225 Difference]: With dead ends: 1528 [2019-10-13 23:22:37,771 INFO L226 Difference]: Without dead ends: 836 [2019-10-13 23:22:37,777 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:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-10-13 23:22:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-10-13 23:22:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-13 23:22:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1078 transitions. [2019-10-13 23:22:37,842 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1078 transitions. Word has length 91 [2019-10-13 23:22:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:37,843 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1078 transitions. [2019-10-13 23:22:37,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1078 transitions. [2019-10-13 23:22:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 23:22:37,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:37,847 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] [2019-10-13 23:22:37,847 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1961062905, now seen corresponding path program 1 times [2019-10-13 23:22:37,848 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:37,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660377165] [2019-10-13 23:22:37,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:37,950 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:37,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660377165] [2019-10-13 23:22:37,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:37,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:37,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961554284] [2019-10-13 23:22:37,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:37,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:37,953 INFO L87 Difference]: Start difference. First operand 836 states and 1078 transitions. Second operand 4 states. [2019-10-13 23:22:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,005 INFO L93 Difference]: Finished difference Result 1494 states and 1929 transitions. [2019-10-13 23:22:38,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:38,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-13 23:22:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,012 INFO L225 Difference]: With dead ends: 1494 [2019-10-13 23:22:38,013 INFO L226 Difference]: Without dead ends: 828 [2019-10-13 23:22:38,019 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,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-10-13 23:22:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2019-10-13 23:22:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-10-13 23:22:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1054 transitions. [2019-10-13 23:22:38,063 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1054 transitions. Word has length 93 [2019-10-13 23:22:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,064 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1054 transitions. [2019-10-13 23:22:38,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1054 transitions. [2019-10-13 23:22:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 23:22:38,066 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,066 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] [2019-10-13 23:22:38,067 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 534163009, now seen corresponding path program 1 times [2019-10-13 23:22:38,067 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545391301] [2019-10-13 23:22:38,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:38,341 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:38,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545391301] [2019-10-13 23:22:38,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:38,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:22:38,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230612059] [2019-10-13 23:22:38,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:22:38,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:38,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:22:38,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:38,345 INFO L87 Difference]: Start difference. First operand 828 states and 1054 transitions. Second operand 8 states. [2019-10-13 23:22:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,808 INFO L93 Difference]: Finished difference Result 1237 states and 1586 transitions. [2019-10-13 23:22:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:38,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-10-13 23:22:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,820 INFO L225 Difference]: With dead ends: 1237 [2019-10-13 23:22:38,820 INFO L226 Difference]: Without dead ends: 1235 [2019-10-13 23:22:38,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:22:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-10-13 23:22:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1168. [2019-10-13 23:22:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2019-10-13 23:22:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1484 transitions. [2019-10-13 23:22:38,903 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1484 transitions. Word has length 92 [2019-10-13 23:22:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,904 INFO L462 AbstractCegarLoop]: Abstraction has 1168 states and 1484 transitions. [2019-10-13 23:22:38,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:22:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1484 transitions. [2019-10-13 23:22:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 23:22:38,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,906 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] [2019-10-13 23:22:38,906 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1249614211, now seen corresponding path program 1 times [2019-10-13 23:22:38,907 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095631858] [2019-10-13 23:22:38,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:39,036 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:39,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095631858] [2019-10-13 23:22:39,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:39,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:39,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888459382] [2019-10-13 23:22:39,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:39,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:39,038 INFO L87 Difference]: Start difference. First operand 1168 states and 1484 transitions. Second operand 7 states. [2019-10-13 23:22:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:39,143 INFO L93 Difference]: Finished difference Result 1217 states and 1562 transitions. [2019-10-13 23:22:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:22:39,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-10-13 23:22:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:39,151 INFO L225 Difference]: With dead ends: 1217 [2019-10-13 23:22:39,151 INFO L226 Difference]: Without dead ends: 1215 [2019-10-13 23:22:39,153 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:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-10-13 23:22:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 848. [2019-10-13 23:22:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-13 23:22:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1076 transitions. [2019-10-13 23:22:39,219 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1076 transitions. Word has length 92 [2019-10-13 23:22:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:39,222 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1076 transitions. [2019-10-13 23:22:39,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1076 transitions. [2019-10-13 23:22:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 23:22:39,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:39,224 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] [2019-10-13 23:22:39,225 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:39,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash -371642591, now seen corresponding path program 1 times [2019-10-13 23:22:39,225 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:39,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187133497] [2019-10-13 23:22:39,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:39,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:39,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:39,516 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:39,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187133497] [2019-10-13 23:22:39,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:39,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:22:39,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367345830] [2019-10-13 23:22:39,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:22:39,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:39,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:22:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:39,519 INFO L87 Difference]: Start difference. First operand 848 states and 1076 transitions. Second operand 12 states. [2019-10-13 23:22:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,863 INFO L93 Difference]: Finished difference Result 2444 states and 3060 transitions. [2019-10-13 23:22:42,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:42,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-10-13 23:22:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,877 INFO L225 Difference]: With dead ends: 2444 [2019-10-13 23:22:42,877 INFO L226 Difference]: Without dead ends: 1766 [2019-10-13 23:22:42,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-10-13 23:22:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1373. [2019-10-13 23:22:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-10-13 23:22:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1730 transitions. [2019-10-13 23:22:42,977 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1730 transitions. Word has length 97 [2019-10-13 23:22:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,978 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 1730 transitions. [2019-10-13 23:22:42,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:22:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1730 transitions. [2019-10-13 23:22:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 23:22:42,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,980 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] [2019-10-13 23:22:42,981 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash -91002566, now seen corresponding path program 1 times [2019-10-13 23:22:42,981 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859654243] [2019-10-13 23:22:42,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,104 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:43,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859654243] [2019-10-13 23:22:43,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:43,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593515480] [2019-10-13 23:22:43,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:43,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:43,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:43,107 INFO L87 Difference]: Start difference. First operand 1373 states and 1730 transitions. Second operand 5 states. [2019-10-13 23:22:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,521 INFO L93 Difference]: Finished difference Result 4907 states and 6257 transitions. [2019-10-13 23:22:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:43,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-13 23:22:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,548 INFO L225 Difference]: With dead ends: 4907 [2019-10-13 23:22:43,548 INFO L226 Difference]: Without dead ends: 3694 [2019-10-13 23:22:43,555 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:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-10-13 23:22:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3436. [2019-10-13 23:22:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2019-10-13 23:22:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 4348 transitions. [2019-10-13 23:22:43,752 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 4348 transitions. Word has length 98 [2019-10-13 23:22:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,752 INFO L462 AbstractCegarLoop]: Abstraction has 3436 states and 4348 transitions. [2019-10-13 23:22:43,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 4348 transitions. [2019-10-13 23:22:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 23:22:43,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,756 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] [2019-10-13 23:22:43,756 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1778951428, now seen corresponding path program 1 times [2019-10-13 23:22:43,757 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728023161] [2019-10-13 23:22:43,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:44,012 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:44,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728023161] [2019-10-13 23:22:44,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:44,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:44,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743175616] [2019-10-13 23:22:44,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:44,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:44,015 INFO L87 Difference]: Start difference. First operand 3436 states and 4348 transitions. Second operand 9 states. [2019-10-13 23:22:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,318 INFO L93 Difference]: Finished difference Result 7473 states and 9491 transitions. [2019-10-13 23:22:45,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:45,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-10-13 23:22:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,347 INFO L225 Difference]: With dead ends: 7473 [2019-10-13 23:22:45,347 INFO L226 Difference]: Without dead ends: 4401 [2019-10-13 23:22:45,361 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:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2019-10-13 23:22:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3986. [2019-10-13 23:22:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3986 states. [2019-10-13 23:22:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 5033 transitions. [2019-10-13 23:22:45,614 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 5033 transitions. Word has length 98 [2019-10-13 23:22:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,615 INFO L462 AbstractCegarLoop]: Abstraction has 3986 states and 5033 transitions. [2019-10-13 23:22:45,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 5033 transitions. [2019-10-13 23:22:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 23:22:45,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,618 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] [2019-10-13 23:22:45,618 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash -693645360, now seen corresponding path program 1 times [2019-10-13 23:22:45,619 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91905505] [2019-10-13 23:22:45,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,891 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:45,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91905505] [2019-10-13 23:22:45,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:45,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:45,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868948034] [2019-10-13 23:22:45,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:45,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:45,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:45,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:45,905 INFO L87 Difference]: Start difference. First operand 3986 states and 5033 transitions. Second operand 9 states. [2019-10-13 23:22:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:47,574 INFO L93 Difference]: Finished difference Result 7879 states and 10135 transitions. [2019-10-13 23:22:47,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:22:47,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-10-13 23:22:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:47,613 INFO L225 Difference]: With dead ends: 7879 [2019-10-13 23:22:47,613 INFO L226 Difference]: Without dead ends: 4293 [2019-10-13 23:22:47,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:22:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2019-10-13 23:22:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 3731. [2019-10-13 23:22:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3731 states. [2019-10-13 23:22:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4730 transitions. [2019-10-13 23:22:47,977 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4730 transitions. Word has length 100 [2019-10-13 23:22:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:47,978 INFO L462 AbstractCegarLoop]: Abstraction has 3731 states and 4730 transitions. [2019-10-13 23:22:47,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4730 transitions. [2019-10-13 23:22:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:47,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:47,981 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] [2019-10-13 23:22:47,981 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 47221803, now seen corresponding path program 1 times [2019-10-13 23:22:47,982 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:47,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839762572] [2019-10-13 23:22:47,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:47,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:47,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:48,076 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:48,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839762572] [2019-10-13 23:22:48,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:48,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:48,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365608467] [2019-10-13 23:22:48,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:48,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:48,079 INFO L87 Difference]: Start difference. First operand 3731 states and 4730 transitions. Second operand 4 states. [2019-10-13 23:22:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:48,251 INFO L93 Difference]: Finished difference Result 6991 states and 8932 transitions. [2019-10-13 23:22:48,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:48,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-13 23:22:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:48,274 INFO L225 Difference]: With dead ends: 6991 [2019-10-13 23:22:48,274 INFO L226 Difference]: Without dead ends: 3673 [2019-10-13 23:22:48,287 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:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2019-10-13 23:22:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3673. [2019-10-13 23:22:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-10-13 23:22:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4556 transitions. [2019-10-13 23:22:48,511 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4556 transitions. Word has length 102 [2019-10-13 23:22:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:48,513 INFO L462 AbstractCegarLoop]: Abstraction has 3673 states and 4556 transitions. [2019-10-13 23:22:48,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4556 transitions. [2019-10-13 23:22:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:48,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:48,517 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:48,517 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1122908653, now seen corresponding path program 1 times [2019-10-13 23:22:48,518 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:48,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375048564] [2019-10-13 23:22:48,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:48,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:48,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:48,603 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,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375048564] [2019-10-13 23:22:48,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:48,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:48,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536046077] [2019-10-13 23:22:48,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:48,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:48,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:48,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:48,606 INFO L87 Difference]: Start difference. First operand 3673 states and 4556 transitions. Second operand 5 states. [2019-10-13 23:22:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:49,150 INFO L93 Difference]: Finished difference Result 11003 states and 13589 transitions. [2019-10-13 23:22:49,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:49,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 23:22:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:49,194 INFO L225 Difference]: With dead ends: 11003 [2019-10-13 23:22:49,194 INFO L226 Difference]: Without dead ends: 7835 [2019-10-13 23:22:49,208 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:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2019-10-13 23:22:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 6172. [2019-10-13 23:22:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6172 states. [2019-10-13 23:22:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 7614 transitions. [2019-10-13 23:22:49,580 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 7614 transitions. Word has length 102 [2019-10-13 23:22:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:49,580 INFO L462 AbstractCegarLoop]: Abstraction has 6172 states and 7614 transitions. [2019-10-13 23:22:49,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 7614 transitions. [2019-10-13 23:22:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:49,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:49,584 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:49,585 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash -311747556, now seen corresponding path program 1 times [2019-10-13 23:22:49,585 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:49,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66622954] [2019-10-13 23:22:49,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:49,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:49,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:49,667 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:49,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66622954] [2019-10-13 23:22:49,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:49,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:49,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443104745] [2019-10-13 23:22:49,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:49,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:49,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:49,671 INFO L87 Difference]: Start difference. First operand 6172 states and 7614 transitions. Second operand 5 states. [2019-10-13 23:22:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:50,380 INFO L93 Difference]: Finished difference Result 14042 states and 17225 transitions. [2019-10-13 23:22:50,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:50,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 23:22:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:50,422 INFO L225 Difference]: With dead ends: 14042 [2019-10-13 23:22:50,423 INFO L226 Difference]: Without dead ends: 8565 [2019-10-13 23:22:50,442 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:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8565 states. [2019-10-13 23:22:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8565 to 8209. [2019-10-13 23:22:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8209 states. [2019-10-13 23:22:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8209 states to 8209 states and 10035 transitions. [2019-10-13 23:22:50,895 INFO L78 Accepts]: Start accepts. Automaton has 8209 states and 10035 transitions. Word has length 102 [2019-10-13 23:22:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:50,895 INFO L462 AbstractCegarLoop]: Abstraction has 8209 states and 10035 transitions. [2019-10-13 23:22:50,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 8209 states and 10035 transitions. [2019-10-13 23:22:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 23:22:50,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:50,903 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] [2019-10-13 23:22:50,904 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1621883247, now seen corresponding path program 1 times [2019-10-13 23:22:50,904 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:50,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253917421] [2019-10-13 23:22:50,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:50,961 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:50,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253917421] [2019-10-13 23:22:50,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:50,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:50,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626477125] [2019-10-13 23:22:50,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:50,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:50,963 INFO L87 Difference]: Start difference. First operand 8209 states and 10035 transitions. Second operand 3 states. [2019-10-13 23:22:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:51,325 INFO L93 Difference]: Finished difference Result 15768 states and 19208 transitions. [2019-10-13 23:22:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:51,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-13 23:22:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:51,360 INFO L225 Difference]: With dead ends: 15768 [2019-10-13 23:22:51,360 INFO L226 Difference]: Without dead ends: 8248 [2019-10-13 23:22:51,381 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:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states. [2019-10-13 23:22:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 8215. [2019-10-13 23:22:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8215 states. [2019-10-13 23:22:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8215 states to 8215 states and 10041 transitions. [2019-10-13 23:22:51,967 INFO L78 Accepts]: Start accepts. Automaton has 8215 states and 10041 transitions. Word has length 103 [2019-10-13 23:22:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:51,968 INFO L462 AbstractCegarLoop]: Abstraction has 8215 states and 10041 transitions. [2019-10-13 23:22:51,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 8215 states and 10041 transitions. [2019-10-13 23:22:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 23:22:51,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:51,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, 1, 1] [2019-10-13 23:22:51,976 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1474773640, now seen corresponding path program 1 times [2019-10-13 23:22:51,977 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:51,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115592191] [2019-10-13 23:22:51,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:51,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:51,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:52,296 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,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115592191] [2019-10-13 23:22:52,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:52,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:52,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458665092] [2019-10-13 23:22:52,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:52,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:52,299 INFO L87 Difference]: Start difference. First operand 8215 states and 10041 transitions. Second operand 9 states. [2019-10-13 23:22:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:54,326 INFO L93 Difference]: Finished difference Result 15712 states and 19102 transitions. [2019-10-13 23:22:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:22:54,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-13 23:22:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:54,371 INFO L225 Difference]: With dead ends: 15712 [2019-10-13 23:22:54,371 INFO L226 Difference]: Without dead ends: 7677 [2019-10-13 23:22:54,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:22:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7677 states. [2019-10-13 23:22:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7677 to 6930. [2019-10-13 23:22:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6930 states. [2019-10-13 23:22:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6930 states to 6930 states and 8386 transitions. [2019-10-13 23:22:55,117 INFO L78 Accepts]: Start accepts. Automaton has 6930 states and 8386 transitions. Word has length 104 [2019-10-13 23:22:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:55,117 INFO L462 AbstractCegarLoop]: Abstraction has 6930 states and 8386 transitions. [2019-10-13 23:22:55,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6930 states and 8386 transitions. [2019-10-13 23:22:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 23:22:55,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:55,121 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] [2019-10-13 23:22:55,121 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1828873027, now seen corresponding path program 1 times [2019-10-13 23:22:55,122 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:55,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845175911] [2019-10-13 23:22:55,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:55,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:55,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:55,321 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:55,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845175911] [2019-10-13 23:22:55,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:55,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:22:55,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619755206] [2019-10-13 23:22:55,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:22:55,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:55,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:22:55,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:55,323 INFO L87 Difference]: Start difference. First operand 6930 states and 8386 transitions. Second operand 8 states. [2019-10-13 23:22:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:56,650 INFO L93 Difference]: Finished difference Result 13615 states and 16453 transitions. [2019-10-13 23:22:56,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:22:56,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-10-13 23:22:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:56,680 INFO L225 Difference]: With dead ends: 13615 [2019-10-13 23:22:56,680 INFO L226 Difference]: Without dead ends: 6974 [2019-10-13 23:22:56,694 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:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2019-10-13 23:22:57,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6772. [2019-10-13 23:22:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6772 states. [2019-10-13 23:22:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6772 states to 6772 states and 8178 transitions. [2019-10-13 23:22:57,345 INFO L78 Accepts]: Start accepts. Automaton has 6772 states and 8178 transitions. Word has length 105 [2019-10-13 23:22:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:57,346 INFO L462 AbstractCegarLoop]: Abstraction has 6772 states and 8178 transitions. [2019-10-13 23:22:57,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:22:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 6772 states and 8178 transitions. [2019-10-13 23:22:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 23:22:57,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:57,352 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:57,352 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash -653612548, now seen corresponding path program 1 times [2019-10-13 23:22:57,353 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:57,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741675940] [2019-10-13 23:22:57,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:57,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:57,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:57,440 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,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741675940] [2019-10-13 23:22:57,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:57,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:57,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672895730] [2019-10-13 23:22:57,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:57,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:57,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:57,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:57,446 INFO L87 Difference]: Start difference. First operand 6772 states and 8178 transitions. Second operand 4 states. [2019-10-13 23:22:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:57,851 INFO L93 Difference]: Finished difference Result 13109 states and 15788 transitions. [2019-10-13 23:22:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:57,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 23:22:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:57,877 INFO L225 Difference]: With dead ends: 13109 [2019-10-13 23:22:57,877 INFO L226 Difference]: Without dead ends: 6626 [2019-10-13 23:22:57,890 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:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-10-13 23:22:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6267. [2019-10-13 23:22:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6267 states. [2019-10-13 23:22:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 7549 transitions. [2019-10-13 23:22:58,305 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 7549 transitions. Word has length 106 [2019-10-13 23:22:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:58,306 INFO L462 AbstractCegarLoop]: Abstraction has 6267 states and 7549 transitions. [2019-10-13 23:22:58,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 7549 transitions. [2019-10-13 23:22:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 23:22:58,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:58,310 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] [2019-10-13 23:22:58,310 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2135673103, now seen corresponding path program 1 times [2019-10-13 23:22:58,311 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:58,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775038375] [2019-10-13 23:22:58,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:58,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:58,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:58,406 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:22:58,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775038375] [2019-10-13 23:22:58,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:58,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:58,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925681007] [2019-10-13 23:22:58,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:58,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:58,409 INFO L87 Difference]: Start difference. First operand 6267 states and 7549 transitions. Second operand 4 states. [2019-10-13 23:22:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:58,788 INFO L93 Difference]: Finished difference Result 12146 states and 14755 transitions. [2019-10-13 23:22:58,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:58,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-10-13 23:22:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:58,808 INFO L225 Difference]: With dead ends: 12146 [2019-10-13 23:22:58,809 INFO L226 Difference]: Without dead ends: 6147 [2019-10-13 23:22:58,820 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:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2019-10-13 23:22:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 5769. [2019-10-13 23:22:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2019-10-13 23:22:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 6709 transitions. [2019-10-13 23:22:59,178 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 6709 transitions. Word has length 118 [2019-10-13 23:22:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:59,178 INFO L462 AbstractCegarLoop]: Abstraction has 5769 states and 6709 transitions. [2019-10-13 23:22:59,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 6709 transitions. [2019-10-13 23:22:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 23:22:59,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:59,183 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] [2019-10-13 23:22:59,183 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash -395511045, now seen corresponding path program 1 times [2019-10-13 23:22:59,184 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:59,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729090708] [2019-10-13 23:22:59,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:59,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:59,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:59,277 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:22:59,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729090708] [2019-10-13 23:22:59,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:59,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:59,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917846402] [2019-10-13 23:22:59,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:59,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:59,280 INFO L87 Difference]: Start difference. First operand 5769 states and 6709 transitions. Second operand 4 states. [2019-10-13 23:22:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:59,617 INFO L93 Difference]: Finished difference Result 11112 states and 12961 transitions. [2019-10-13 23:22:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:59,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-13 23:22:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:59,645 INFO L225 Difference]: With dead ends: 11112 [2019-10-13 23:22:59,645 INFO L226 Difference]: Without dead ends: 5631 [2019-10-13 23:22:59,659 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:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-10-13 23:23:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5227. [2019-10-13 23:23:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5227 states. [2019-10-13 23:23:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 5900 transitions. [2019-10-13 23:23:00,068 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 5900 transitions. Word has length 134 [2019-10-13 23:23:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:23:00,069 INFO L462 AbstractCegarLoop]: Abstraction has 5227 states and 5900 transitions. [2019-10-13 23:23:00,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:23:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 5900 transitions. [2019-10-13 23:23:00,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 23:23:00,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:23:00,079 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] [2019-10-13 23:23:00,079 INFO L410 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:23:00,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:23:00,228 INFO L82 PathProgramCache]: Analyzing trace with hash 437841812, now seen corresponding path program 1 times [2019-10-13 23:23:00,229 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:23:00,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886111483] [2019-10-13 23:23:00,229 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:00,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:00,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:23:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:23:00,417 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:00,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886111483] [2019-10-13 23:23:00,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176005800] [2019-10-13 23:23:00,418 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