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.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:54:16,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:54:16,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:54:16,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:54:16,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:54:16,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:54:16,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:54:16,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:54:16,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:54:16,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:54:16,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:54:16,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:54:16,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:54:16,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:54:16,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:54:16,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:54:16,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:54:16,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:54:16,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:54:16,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:54:16,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:54:16,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:54:16,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:54:16,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:54:16,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:54:16,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:54:16,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:54:16,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:54:16,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:54:16,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:54:16,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:54:16,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:54:16,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:54:16,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:54:16,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:54:16,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:54:16,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:54:16,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:54:16,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:54:16,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:54:16,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:54:16,107 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-07 15:54:16,141 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:54:16,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:54:16,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:54:16,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:54:16,143 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:54:16,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:54:16,143 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:54:16,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:54:16,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:54:16,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:54:16,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:54:16,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:54:16,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:54:16,144 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:54:16,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:54:16,145 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:54:16,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:54:16,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:54:16,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:54:16,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:54:16,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:54:16,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:16,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:54:16,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:54:16,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:54:16,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:54:16,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:54:16,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:54:16,152 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-07 15:54:16,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:54:16,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:54:16,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:54:16,432 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:54:16,432 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:54:16,433 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.UNBOUNDED.pals.c [2019-10-07 15:54:16,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ca95a02/e49baf7ef905451a8a9a853dc60bf561/FLAGbcd765531 [2019-10-07 15:54:17,074 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:54:17,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-07 15:54:17,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ca95a02/e49baf7ef905451a8a9a853dc60bf561/FLAGbcd765531 [2019-10-07 15:54:17,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ca95a02/e49baf7ef905451a8a9a853dc60bf561 [2019-10-07 15:54:17,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:54:17,365 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:54:17,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:17,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:54:17,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:54:17,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:17,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b33f87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17, skipping insertion in model container [2019-10-07 15:54:17,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:17,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:54:17,430 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:54:17,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:17,817 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:54:17,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:17,932 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:54:17,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17 WrapperNode [2019-10-07 15:54:17,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:17,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:54:17,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:54:17,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:54:17,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:17,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:17,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:17,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:17,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:17,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:17,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (1/1) ... [2019-10-07 15:54:18,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:54:18,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:54:18,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:54:18,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:54:18,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (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-07 15:54:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:54:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:54:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-07 15:54:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-07 15:54:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-07 15:54:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-07 15:54:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-07 15:54:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-07 15:54:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-07 15:54:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-07 15:54:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-07 15:54:18,060 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-07 15:54:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-07 15:54:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-07 15:54:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-07 15:54:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-07 15:54:18,061 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-07 15:54:18,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:54:18,062 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-07 15:54:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:54:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 15:54:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 15:54:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 15:54:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-07 15:54:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-07 15:54:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 15:54:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-07 15:54:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-07 15:54:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-07 15:54:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-07 15:54:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-07 15:54:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-07 15:54:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 15:54:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:54:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:54:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:54:19,394 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:54:19,395 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 15:54:19,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:19 BoogieIcfgContainer [2019-10-07 15:54:19,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:54:19,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:54:19,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:54:19,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:54:19,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:54:17" (1/3) ... [2019-10-07 15:54:19,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4e5cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:19, skipping insertion in model container [2019-10-07 15:54:19,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:17" (2/3) ... [2019-10-07 15:54:19,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4e5cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:19, skipping insertion in model container [2019-10-07 15:54:19,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:19" (3/3) ... [2019-10-07 15:54:19,404 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-07 15:54:19,413 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:54:19,421 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:54:19,433 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:54:19,460 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:54:19,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:54:19,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:54:19,461 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:54:19,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:54:19,462 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:54:19,463 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:54:19,463 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:54:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2019-10-07 15:54:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 15:54:19,508 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:19,509 INFO L385 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-07 15:54:19,512 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash -696783202, now seen corresponding path program 1 times [2019-10-07 15:54:19,532 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:19,533 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:19,533 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:19,533 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:20,120 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-07 15:54:20,121 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:20,122 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:20,122 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:20,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:20,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:20,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:20,146 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 4 states. [2019-10-07 15:54:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:20,318 INFO L93 Difference]: Finished difference Result 350 states and 532 transitions. [2019-10-07 15:54:20,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:20,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-07 15:54:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:20,343 INFO L225 Difference]: With dead ends: 350 [2019-10-07 15:54:20,343 INFO L226 Difference]: Without dead ends: 180 [2019-10-07 15:54:20,358 INFO L606 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-07 15:54:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-07 15:54:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-10-07 15:54:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-07 15:54:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2019-10-07 15:54:20,465 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 44 [2019-10-07 15:54:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:20,466 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2019-10-07 15:54:20,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2019-10-07 15:54:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 15:54:20,472 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:20,473 INFO L385 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-07 15:54:20,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash 942948947, now seen corresponding path program 1 times [2019-10-07 15:54:20,475 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:20,476 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:20,476 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:20,476 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:20,706 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-07 15:54:20,707 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:20,708 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:20,708 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:20,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:20,714 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand 5 states. [2019-10-07 15:54:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:20,871 INFO L93 Difference]: Finished difference Result 689 states and 976 transitions. [2019-10-07 15:54:20,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:20,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-07 15:54:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:20,879 INFO L225 Difference]: With dead ends: 689 [2019-10-07 15:54:20,880 INFO L226 Difference]: Without dead ends: 500 [2019-10-07 15:54:20,881 INFO L606 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-07 15:54:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-07 15:54:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 357. [2019-10-07 15:54:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-07 15:54:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 504 transitions. [2019-10-07 15:54:20,937 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 504 transitions. Word has length 58 [2019-10-07 15:54:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:20,938 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 504 transitions. [2019-10-07 15:54:20,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 504 transitions. [2019-10-07 15:54:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 15:54:20,941 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:20,941 INFO L385 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-07 15:54:20,941 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1685484368, now seen corresponding path program 1 times [2019-10-07 15:54:20,942 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:20,942 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:20,942 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:20,942 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:21,038 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-07 15:54:21,039 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,039 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:21,039 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:21,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:21,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:21,041 INFO L87 Difference]: Start difference. First operand 357 states and 504 transitions. Second operand 4 states. [2019-10-07 15:54:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:21,092 INFO L93 Difference]: Finished difference Result 715 states and 1015 transitions. [2019-10-07 15:54:21,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:21,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-07 15:54:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:21,096 INFO L225 Difference]: With dead ends: 715 [2019-10-07 15:54:21,097 INFO L226 Difference]: Without dead ends: 367 [2019-10-07 15:54:21,099 INFO L606 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-07 15:54:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-07 15:54:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2019-10-07 15:54:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-07 15:54:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 512 transitions. [2019-10-07 15:54:21,135 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 512 transitions. Word has length 60 [2019-10-07 15:54:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:21,136 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 512 transitions. [2019-10-07 15:54:21,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 512 transitions. [2019-10-07 15:54:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 15:54:21,142 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:21,143 INFO L385 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-07 15:54:21,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash 952873872, now seen corresponding path program 1 times [2019-10-07 15:54:21,145 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:21,146 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:21,280 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-07 15:54:21,280 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,280 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:21,280 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:21,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:21,282 INFO L87 Difference]: Start difference. First operand 367 states and 512 transitions. Second operand 4 states. [2019-10-07 15:54:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:21,343 INFO L93 Difference]: Finished difference Result 735 states and 1037 transitions. [2019-10-07 15:54:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:21,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-07 15:54:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:21,348 INFO L225 Difference]: With dead ends: 735 [2019-10-07 15:54:21,348 INFO L226 Difference]: Without dead ends: 377 [2019-10-07 15:54:21,350 INFO L606 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-07 15:54:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-10-07 15:54:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-10-07 15:54:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-10-07 15:54:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 520 transitions. [2019-10-07 15:54:21,380 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 520 transitions. Word has length 68 [2019-10-07 15:54:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:21,380 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 520 transitions. [2019-10-07 15:54:21,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 520 transitions. [2019-10-07 15:54:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 15:54:21,383 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:21,383 INFO L385 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-07 15:54:21,383 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:21,384 INFO L82 PathProgramCache]: Analyzing trace with hash 81922330, now seen corresponding path program 1 times [2019-10-07 15:54:21,384 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:21,384 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,384 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,385 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:21,468 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-07 15:54:21,469 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,469 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:21,469 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:21,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:21,470 INFO L87 Difference]: Start difference. First operand 377 states and 520 transitions. Second operand 4 states. [2019-10-07 15:54:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:21,545 INFO L93 Difference]: Finished difference Result 753 states and 1045 transitions. [2019-10-07 15:54:21,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:21,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-07 15:54:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:21,549 INFO L225 Difference]: With dead ends: 753 [2019-10-07 15:54:21,549 INFO L226 Difference]: Without dead ends: 385 [2019-10-07 15:54:21,551 INFO L606 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-07 15:54:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-10-07 15:54:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-10-07 15:54:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-10-07 15:54:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 526 transitions. [2019-10-07 15:54:21,570 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 526 transitions. Word has length 76 [2019-10-07 15:54:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:21,570 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 526 transitions. [2019-10-07 15:54:21,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 526 transitions. [2019-10-07 15:54:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 15:54:21,572 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:21,572 INFO L385 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-07 15:54:21,572 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash 205873206, now seen corresponding path program 1 times [2019-10-07 15:54:21,573 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:21,573 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:21,675 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-07 15:54:21,675 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,676 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:21,676 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:21,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:21,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:21,682 INFO L87 Difference]: Start difference. First operand 385 states and 526 transitions. Second operand 4 states. [2019-10-07 15:54:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:21,757 INFO L93 Difference]: Finished difference Result 771 states and 1065 transitions. [2019-10-07 15:54:21,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:21,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-07 15:54:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:21,763 INFO L225 Difference]: With dead ends: 771 [2019-10-07 15:54:21,764 INFO L226 Difference]: Without dead ends: 395 [2019-10-07 15:54:21,766 INFO L606 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-07 15:54:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-07 15:54:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-10-07 15:54:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-07 15:54:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 534 transitions. [2019-10-07 15:54:21,795 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 534 transitions. Word has length 76 [2019-10-07 15:54:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:21,796 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 534 transitions. [2019-10-07 15:54:21,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 534 transitions. [2019-10-07 15:54:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-07 15:54:21,798 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:21,798 INFO L385 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-07 15:54:21,799 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1572038470, now seen corresponding path program 1 times [2019-10-07 15:54:21,799 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:21,799 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,800 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,800 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:21,930 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-07 15:54:21,930 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,930 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:21,931 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:21,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:21,932 INFO L87 Difference]: Start difference. First operand 395 states and 534 transitions. Second operand 4 states. [2019-10-07 15:54:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:21,982 INFO L93 Difference]: Finished difference Result 793 states and 1079 transitions. [2019-10-07 15:54:21,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:21,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-07 15:54:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:21,987 INFO L225 Difference]: With dead ends: 793 [2019-10-07 15:54:21,987 INFO L226 Difference]: Without dead ends: 407 [2019-10-07 15:54:21,989 INFO L606 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-07 15:54:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-07 15:54:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-10-07 15:54:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-07 15:54:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2019-10-07 15:54:22,014 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 84 [2019-10-07 15:54:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:22,015 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2019-10-07 15:54:22,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2019-10-07 15:54:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-07 15:54:22,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:22,023 INFO L385 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-07 15:54:22,023 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:22,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:22,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1474569183, now seen corresponding path program 1 times [2019-10-07 15:54:22,024 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:22,024 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,024 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:22,024 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:22,330 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-07 15:54:22,330 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,330 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:22,330 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:54:22,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:54:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:54:22,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:22,331 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand 12 states. [2019-10-07 15:54:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,209 INFO L93 Difference]: Finished difference Result 1284 states and 1689 transitions. [2019-10-07 15:54:25,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:54:25,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-10-07 15:54:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,216 INFO L225 Difference]: With dead ends: 1284 [2019-10-07 15:54:25,217 INFO L226 Difference]: Without dead ends: 886 [2019-10-07 15:54:25,218 INFO L606 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-07 15:54:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-10-07 15:54:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 826. [2019-10-07 15:54:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-07 15:54:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1080 transitions. [2019-10-07 15:54:25,271 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1080 transitions. Word has length 89 [2019-10-07 15:54:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,272 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1080 transitions. [2019-10-07 15:54:25,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:54:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1080 transitions. [2019-10-07 15:54:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-07 15:54:25,276 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,276 INFO L385 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-07 15:54:25,277 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1411945989, now seen corresponding path program 1 times [2019-10-07 15:54:25,277 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,277 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,278 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,278 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,382 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-07 15:54:25,383 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,383 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,383 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:25,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:25,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:25,385 INFO L87 Difference]: Start difference. First operand 826 states and 1080 transitions. Second operand 4 states. [2019-10-07 15:54:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,448 INFO L93 Difference]: Finished difference Result 1524 states and 1999 transitions. [2019-10-07 15:54:25,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:25,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-07 15:54:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,453 INFO L225 Difference]: With dead ends: 1524 [2019-10-07 15:54:25,453 INFO L226 Difference]: Without dead ends: 834 [2019-10-07 15:54:25,456 INFO L606 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-07 15:54:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-10-07 15:54:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2019-10-07 15:54:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-10-07 15:54:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1076 transitions. [2019-10-07 15:54:25,503 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1076 transitions. Word has length 91 [2019-10-07 15:54:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,504 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1076 transitions. [2019-10-07 15:54:25,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1076 transitions. [2019-10-07 15:54:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-07 15:54:25,506 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,507 INFO L385 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-07 15:54:25,507 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash -829194726, now seen corresponding path program 1 times [2019-10-07 15:54:25,508 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,508 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,624 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-07 15:54:25,625 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,625 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,625 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:25,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:25,626 INFO L87 Difference]: Start difference. First operand 834 states and 1076 transitions. Second operand 4 states. [2019-10-07 15:54:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,683 INFO L93 Difference]: Finished difference Result 1490 states and 1925 transitions. [2019-10-07 15:54:25,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:25,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-07 15:54:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,739 INFO L225 Difference]: With dead ends: 1490 [2019-10-07 15:54:25,739 INFO L226 Difference]: Without dead ends: 826 [2019-10-07 15:54:25,741 INFO L606 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-07 15:54:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-10-07 15:54:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2019-10-07 15:54:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-07 15:54:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1052 transitions. [2019-10-07 15:54:25,794 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1052 transitions. Word has length 93 [2019-10-07 15:54:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,795 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1052 transitions. [2019-10-07 15:54:25,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1052 transitions. [2019-10-07 15:54:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 15:54:25,796 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,797 INFO L385 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-07 15:54:25,797 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 220728736, now seen corresponding path program 1 times [2019-10-07 15:54:25,797 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,797 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,798 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,798 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,978 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-07 15:54:25,979 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,979 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,979 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:25,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:25,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:25,980 INFO L87 Difference]: Start difference. First operand 826 states and 1052 transitions. Second operand 9 states. [2019-10-07 15:54:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:26,081 INFO L93 Difference]: Finished difference Result 884 states and 1136 transitions. [2019-10-07 15:54:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 15:54:26,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-07 15:54:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:26,087 INFO L225 Difference]: With dead ends: 884 [2019-10-07 15:54:26,087 INFO L226 Difference]: Without dead ends: 882 [2019-10-07 15:54:26,088 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 15:54:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-10-07 15:54:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 846. [2019-10-07 15:54:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-10-07 15:54:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1074 transitions. [2019-10-07 15:54:26,132 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1074 transitions. Word has length 92 [2019-10-07 15:54:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:26,134 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1074 transitions. [2019-10-07 15:54:26,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1074 transitions. [2019-10-07 15:54:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 15:54:26,136 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:26,136 INFO L385 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-07 15:54:26,137 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1901963715, now seen corresponding path program 1 times [2019-10-07 15:54:26,137 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:26,137 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,137 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:26,138 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:26,369 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-07 15:54:26,369 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:26,370 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:26,370 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:54:26,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:54:26,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:54:26,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:26,372 INFO L87 Difference]: Start difference. First operand 846 states and 1074 transitions. Second operand 12 states. [2019-10-07 15:54:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:29,440 INFO L93 Difference]: Finished difference Result 2436 states and 3052 transitions. [2019-10-07 15:54:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:54:29,441 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-10-07 15:54:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:29,451 INFO L225 Difference]: With dead ends: 2436 [2019-10-07 15:54:29,452 INFO L226 Difference]: Without dead ends: 1760 [2019-10-07 15:54:29,454 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-10-07 15:54:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1371. [2019-10-07 15:54:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2019-10-07 15:54:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1728 transitions. [2019-10-07 15:54:29,526 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1728 transitions. Word has length 97 [2019-10-07 15:54:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:29,526 INFO L462 AbstractCegarLoop]: Abstraction has 1371 states and 1728 transitions. [2019-10-07 15:54:29,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:54:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1728 transitions. [2019-10-07 15:54:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-07 15:54:29,528 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:29,529 INFO L385 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-07 15:54:29,529 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1643610553, now seen corresponding path program 1 times [2019-10-07 15:54:29,529 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:29,530 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,530 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,530 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:29,608 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-07 15:54:29,609 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,609 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:29,610 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:29,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:29,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:29,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:29,612 INFO L87 Difference]: Start difference. First operand 1371 states and 1728 transitions. Second operand 5 states. [2019-10-07 15:54:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:30,027 INFO L93 Difference]: Finished difference Result 4899 states and 6249 transitions. [2019-10-07 15:54:30,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:30,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-07 15:54:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:30,055 INFO L225 Difference]: With dead ends: 4899 [2019-10-07 15:54:30,055 INFO L226 Difference]: Without dead ends: 3688 [2019-10-07 15:54:30,068 INFO L606 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-07 15:54:30,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2019-10-07 15:54:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3432. [2019-10-07 15:54:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3432 states. [2019-10-07 15:54:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4344 transitions. [2019-10-07 15:54:30,266 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4344 transitions. Word has length 98 [2019-10-07 15:54:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:30,266 INFO L462 AbstractCegarLoop]: Abstraction has 3432 states and 4344 transitions. [2019-10-07 15:54:30,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4344 transitions. [2019-10-07 15:54:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-07 15:54:30,269 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:30,269 INFO L385 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-07 15:54:30,269 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2019998169, now seen corresponding path program 1 times [2019-10-07 15:54:30,270 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:30,270 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:30,270 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:30,270 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:30,474 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-07 15:54:30,475 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:30,475 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:30,475 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:30,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:30,476 INFO L87 Difference]: Start difference. First operand 3432 states and 4344 transitions. Second operand 9 states. [2019-10-07 15:54:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:31,669 INFO L93 Difference]: Finished difference Result 7463 states and 9481 transitions. [2019-10-07 15:54:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 15:54:31,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-10-07 15:54:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:31,694 INFO L225 Difference]: With dead ends: 7463 [2019-10-07 15:54:31,694 INFO L226 Difference]: Without dead ends: 4395 [2019-10-07 15:54:31,707 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-07 15:54:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2019-10-07 15:54:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 3982. [2019-10-07 15:54:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2019-10-07 15:54:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5029 transitions. [2019-10-07 15:54:31,974 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5029 transitions. Word has length 98 [2019-10-07 15:54:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:31,975 INFO L462 AbstractCegarLoop]: Abstraction has 3982 states and 5029 transitions. [2019-10-07 15:54:31,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5029 transitions. [2019-10-07 15:54:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 15:54:31,979 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:31,979 INFO L385 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-07 15:54:31,979 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1064329041, now seen corresponding path program 1 times [2019-10-07 15:54:31,980 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:31,980 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:31,981 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:31,981 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:32,171 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-07 15:54:32,171 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:32,172 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:32,172 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:32,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:32,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:32,174 INFO L87 Difference]: Start difference. First operand 3982 states and 5029 transitions. Second operand 9 states. [2019-10-07 15:54:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:33,622 INFO L93 Difference]: Finished difference Result 7870 states and 10126 transitions. [2019-10-07 15:54:33,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:54:33,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-10-07 15:54:33,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:33,647 INFO L225 Difference]: With dead ends: 7870 [2019-10-07 15:54:33,647 INFO L226 Difference]: Without dead ends: 4288 [2019-10-07 15:54:33,659 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-07 15:54:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-10-07 15:54:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3727. [2019-10-07 15:54:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2019-10-07 15:54:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 4726 transitions. [2019-10-07 15:54:34,022 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 4726 transitions. Word has length 100 [2019-10-07 15:54:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:34,022 INFO L462 AbstractCegarLoop]: Abstraction has 3727 states and 4726 transitions. [2019-10-07 15:54:34,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 4726 transitions. [2019-10-07 15:54:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:34,026 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:34,027 INFO L385 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-07 15:54:34,027 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:34,028 INFO L82 PathProgramCache]: Analyzing trace with hash 966351914, now seen corresponding path program 1 times [2019-10-07 15:54:34,028 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:34,028 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:34,028 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:34,028 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:34,110 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-07 15:54:34,110 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:34,111 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:34,111 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:34,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:34,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:34,112 INFO L87 Difference]: Start difference. First operand 3727 states and 4726 transitions. Second operand 4 states. [2019-10-07 15:54:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:34,259 INFO L93 Difference]: Finished difference Result 6983 states and 8924 transitions. [2019-10-07 15:54:34,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:34,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-07 15:54:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:34,280 INFO L225 Difference]: With dead ends: 6983 [2019-10-07 15:54:34,281 INFO L226 Difference]: Without dead ends: 3669 [2019-10-07 15:54:34,293 INFO L606 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-07 15:54:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-10-07 15:54:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3669. [2019-10-07 15:54:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3669 states. [2019-10-07 15:54:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 4552 transitions. [2019-10-07 15:54:34,491 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 4552 transitions. Word has length 102 [2019-10-07 15:54:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:34,492 INFO L462 AbstractCegarLoop]: Abstraction has 3669 states and 4552 transitions. [2019-10-07 15:54:34,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4552 transitions. [2019-10-07 15:54:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:34,495 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:34,495 INFO L385 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-07 15:54:34,495 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1813031188, now seen corresponding path program 1 times [2019-10-07 15:54:34,496 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:34,496 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:34,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:34,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:34,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:34,573 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-07 15:54:34,573 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:34,574 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:34,574 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:34,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:34,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:34,575 INFO L87 Difference]: Start difference. First operand 3669 states and 4552 transitions. Second operand 5 states. [2019-10-07 15:54:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:35,203 INFO L93 Difference]: Finished difference Result 10987 states and 13573 transitions. [2019-10-07 15:54:35,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:35,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-07 15:54:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:35,263 INFO L225 Difference]: With dead ends: 10987 [2019-10-07 15:54:35,263 INFO L226 Difference]: Without dead ends: 7823 [2019-10-07 15:54:35,282 INFO L606 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-07 15:54:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2019-10-07 15:54:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 6168. [2019-10-07 15:54:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6168 states. [2019-10-07 15:54:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 7610 transitions. [2019-10-07 15:54:35,615 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 7610 transitions. Word has length 102 [2019-10-07 15:54:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:35,616 INFO L462 AbstractCegarLoop]: Abstraction has 6168 states and 7610 transitions. [2019-10-07 15:54:35,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 7610 transitions. [2019-10-07 15:54:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:35,620 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:35,620 INFO L385 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-07 15:54:35,621 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1205195067, now seen corresponding path program 1 times [2019-10-07 15:54:35,621 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:35,621 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:35,621 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:35,622 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:35,688 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-07 15:54:35,689 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:35,689 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:35,689 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:35,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:35,691 INFO L87 Difference]: Start difference. First operand 6168 states and 7610 transitions. Second operand 5 states. [2019-10-07 15:54:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:36,240 INFO L93 Difference]: Finished difference Result 14029 states and 17212 transitions. [2019-10-07 15:54:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:36,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-07 15:54:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:36,278 INFO L225 Difference]: With dead ends: 14029 [2019-10-07 15:54:36,279 INFO L226 Difference]: Without dead ends: 8556 [2019-10-07 15:54:36,297 INFO L606 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-07 15:54:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8556 states. [2019-10-07 15:54:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8556 to 8204. [2019-10-07 15:54:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-10-07 15:54:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 10030 transitions. [2019-10-07 15:54:36,689 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 10030 transitions. Word has length 102 [2019-10-07 15:54:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:36,690 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 10030 transitions. [2019-10-07 15:54:36,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 10030 transitions. [2019-10-07 15:54:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-07 15:54:36,694 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:36,694 INFO L385 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-07 15:54:36,694 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1595637516, now seen corresponding path program 1 times [2019-10-07 15:54:36,695 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:36,695 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:36,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:36,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:36,743 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-07 15:54:36,743 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:36,743 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:36,743 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:54:36,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:54:36,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:54:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:36,748 INFO L87 Difference]: Start difference. First operand 8204 states and 10030 transitions. Second operand 3 states. [2019-10-07 15:54:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:37,082 INFO L93 Difference]: Finished difference Result 15758 states and 19198 transitions. [2019-10-07 15:54:37,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:54:37,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-07 15:54:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:37,109 INFO L225 Difference]: With dead ends: 15758 [2019-10-07 15:54:37,110 INFO L226 Difference]: Without dead ends: 8243 [2019-10-07 15:54:37,129 INFO L606 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-07 15:54:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8243 states. [2019-10-07 15:54:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8243 to 8210. [2019-10-07 15:54:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8210 states. [2019-10-07 15:54:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8210 states to 8210 states and 10036 transitions. [2019-10-07 15:54:37,521 INFO L78 Accepts]: Start accepts. Automaton has 8210 states and 10036 transitions. Word has length 103 [2019-10-07 15:54:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:37,522 INFO L462 AbstractCegarLoop]: Abstraction has 8210 states and 10036 transitions. [2019-10-07 15:54:37,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:54:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 8210 states and 10036 transitions. [2019-10-07 15:54:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 15:54:37,529 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:37,529 INFO L385 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-07 15:54:37,530 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash -573406473, now seen corresponding path program 1 times [2019-10-07 15:54:37,530 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:37,530 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:37,531 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:37,531 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:37,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:37,723 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-07 15:54:37,723 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:37,724 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:37,724 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:37,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:37,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:37,727 INFO L87 Difference]: Start difference. First operand 8210 states and 10036 transitions. Second operand 9 states. [2019-10-07 15:54:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:39,273 INFO L93 Difference]: Finished difference Result 15702 states and 19092 transitions. [2019-10-07 15:54:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 15:54:39,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-07 15:54:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:39,300 INFO L225 Difference]: With dead ends: 15702 [2019-10-07 15:54:39,300 INFO L226 Difference]: Without dead ends: 7672 [2019-10-07 15:54:39,319 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-07 15:54:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2019-10-07 15:54:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 6925. [2019-10-07 15:54:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6925 states. [2019-10-07 15:54:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6925 states to 6925 states and 8381 transitions. [2019-10-07 15:54:39,689 INFO L78 Accepts]: Start accepts. Automaton has 6925 states and 8381 transitions. Word has length 104 [2019-10-07 15:54:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:39,689 INFO L462 AbstractCegarLoop]: Abstraction has 6925 states and 8381 transitions. [2019-10-07 15:54:39,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6925 states and 8381 transitions. [2019-10-07 15:54:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-07 15:54:39,692 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:39,692 INFO L385 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-07 15:54:39,692 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:39,692 INFO L82 PathProgramCache]: Analyzing trace with hash 789902915, now seen corresponding path program 1 times [2019-10-07 15:54:39,693 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:39,693 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:39,693 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:39,693 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:39,913 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-07 15:54:39,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:39,914 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:39,914 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 15:54:39,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 15:54:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 15:54:39,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:54:39,916 INFO L87 Difference]: Start difference. First operand 6925 states and 8381 transitions. Second operand 8 states. [2019-10-07 15:54:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:41,335 INFO L93 Difference]: Finished difference Result 13563 states and 16384 transitions. [2019-10-07 15:54:41,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 15:54:41,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-10-07 15:54:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:41,357 INFO L225 Difference]: With dead ends: 13563 [2019-10-07 15:54:41,358 INFO L226 Difference]: Without dead ends: 6765 [2019-10-07 15:54:41,369 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-10-07 15:54:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2019-10-07 15:54:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6262. [2019-10-07 15:54:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6262 states. [2019-10-07 15:54:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 7546 transitions. [2019-10-07 15:54:41,705 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 7546 transitions. Word has length 105 [2019-10-07 15:54:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:41,706 INFO L462 AbstractCegarLoop]: Abstraction has 6262 states and 7546 transitions. [2019-10-07 15:54:41,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 15:54:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 7546 transitions. [2019-10-07 15:54:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-07 15:54:41,709 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:41,709 INFO L385 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-07 15:54:41,709 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash 196478960, now seen corresponding path program 1 times [2019-10-07 15:54:41,710 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:41,710 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,710 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,710 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:41,801 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-07 15:54:41,801 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:41,801 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:41,801 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:41,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:41,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:41,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:41,802 INFO L87 Difference]: Start difference. First operand 6262 states and 7546 transitions. Second operand 4 states. [2019-10-07 15:54:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:42,606 INFO L93 Difference]: Finished difference Result 12140 states and 14755 transitions. [2019-10-07 15:54:42,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:42,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-10-07 15:54:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:42,625 INFO L225 Difference]: With dead ends: 12140 [2019-10-07 15:54:42,626 INFO L226 Difference]: Without dead ends: 6142 [2019-10-07 15:54:42,636 INFO L606 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-07 15:54:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2019-10-07 15:54:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 5764. [2019-10-07 15:54:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-10-07 15:54:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6706 transitions. [2019-10-07 15:54:42,937 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6706 transitions. Word has length 118 [2019-10-07 15:54:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:42,938 INFO L462 AbstractCegarLoop]: Abstraction has 5764 states and 6706 transitions. [2019-10-07 15:54:42,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6706 transitions. [2019-10-07 15:54:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-07 15:54:42,941 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:42,941 INFO L385 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-07 15:54:42,941 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash -544879366, now seen corresponding path program 1 times [2019-10-07 15:54:42,942 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:42,942 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:42,942 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,942 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:43,022 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-07 15:54:43,023 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,023 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:43,023 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:43,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:43,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:43,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:43,024 INFO L87 Difference]: Start difference. First operand 5764 states and 6706 transitions. Second operand 4 states. [2019-10-07 15:54:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:43,392 INFO L93 Difference]: Finished difference Result 11106 states and 12961 transitions. [2019-10-07 15:54:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:43,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-07 15:54:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:43,416 INFO L225 Difference]: With dead ends: 11106 [2019-10-07 15:54:43,417 INFO L226 Difference]: Without dead ends: 5626 [2019-10-07 15:54:43,431 INFO L606 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-07 15:54:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2019-10-07 15:54:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 5222. [2019-10-07 15:54:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-10-07 15:54:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 5897 transitions. [2019-10-07 15:54:43,840 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 5897 transitions. Word has length 134 [2019-10-07 15:54:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:43,841 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 5897 transitions. [2019-10-07 15:54:43,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 5897 transitions. [2019-10-07 15:54:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-07 15:54:43,844 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:43,845 INFO L385 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-07 15:54:43,845 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash -161297964, now seen corresponding path program 1 times [2019-10-07 15:54:43,845 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:43,846 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:43,846 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,846 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:44,019 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-07 15:54:44,020 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:44,020 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:44,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 15:54:44,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-07 15:54:44,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 15:54:44,986 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 15:54:44,986 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 9] total 27 [2019-10-07 15:54:44,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 15:54:44,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 15:54:44,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:44,987 INFO L87 Difference]: Start difference. First operand 5222 states and 5897 transitions. Second operand 11 states. [2019-10-07 15:54:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:46,630 INFO L93 Difference]: Finished difference Result 11708 states and 13140 transitions. [2019-10-07 15:54:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:54:46,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 146 [2019-10-07 15:54:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:46,661 INFO L225 Difference]: With dead ends: 11708 [2019-10-07 15:54:46,661 INFO L226 Difference]: Without dead ends: 6702 [2019-10-07 15:54:46,676 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 276 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 15:54:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2019-10-07 15:54:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 4921. [2019-10-07 15:54:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4921 states. [2019-10-07 15:54:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4921 states to 4921 states and 5487 transitions. [2019-10-07 15:54:47,179 INFO L78 Accepts]: Start accepts. Automaton has 4921 states and 5487 transitions. Word has length 146 [2019-10-07 15:54:47,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:47,180 INFO L462 AbstractCegarLoop]: Abstraction has 4921 states and 5487 transitions. [2019-10-07 15:54:47,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 15:54:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 5487 transitions. [2019-10-07 15:54:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-07 15:54:47,183 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:47,184 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:47,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:47,400 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash -603300892, now seen corresponding path program 1 times [2019-10-07 15:54:47,401 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:47,402 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:47,402 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:47,402 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-07 15:54:47,627 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:47,627 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:47,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 15:54:47,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:48,051 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-07 15:54:48,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:54:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-07 15:54:48,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:48,774 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-07 15:54:48,940 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-07 15:54:50,557 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8191 disjunctions. This might take some time... [2019-10-07 15:54:54,431 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 8191 disjunctions.