/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:06:31,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:06:31,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:06:31,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:06:31,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:06:31,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:06:31,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:06:31,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:06:31,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:06:31,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:06:31,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:06:31,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:06:31,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:06:31,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:06:31,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:06:31,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:06:31,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:06:31,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:06:31,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:06:32,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:06:32,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:06:32,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:06:32,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:06:32,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:06:32,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:06:32,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:06:32,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:06:32,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:06:32,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:06:32,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:06:32,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:06:32,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:06:32,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:06:32,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:06:32,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:06:32,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:06:32,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:06:32,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:06:32,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:06:32,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:06:32,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:06:32,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 06:06:32,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:06:32,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:06:32,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:06:32,050 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:06:32,050 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:06:32,051 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:06:32,051 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:06:32,051 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:06:32,051 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:06:32,051 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:06:32,052 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:06:32,053 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:06:32,053 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:06:32,053 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:06:32,053 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:06:32,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:06:32,054 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:06:32,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:06:32,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:06:32,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:06:32,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:06:32,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:06:32,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:06:32,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:06:32,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:06:32,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:06:32,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:06:32,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:06:32,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:06:32,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:06:32,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:06:32,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:06:32,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:06:32,059 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:06:32,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:06:32,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:06:32,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:06:32,060 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:06:32,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:06:32,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:06:32,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:06:32,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:06:32,375 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:06:32,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-11-24 06:06:32,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/341a1d6b6/9ed51157ed1a4ae9a9034ed7fe2f3a4c/FLAG5de4a096f [2019-11-24 06:06:32,910 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:06:32,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-11-24 06:06:32,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/341a1d6b6/9ed51157ed1a4ae9a9034ed7fe2f3a4c/FLAG5de4a096f [2019-11-24 06:06:33,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/341a1d6b6/9ed51157ed1a4ae9a9034ed7fe2f3a4c [2019-11-24 06:06:33,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:06:33,262 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:06:33,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:06:33,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:06:33,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:06:33,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59736caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33, skipping insertion in model container [2019-11-24 06:06:33,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:06:33,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:06:33,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:06:33,592 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:06:33,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:06:33,760 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:06:33,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33 WrapperNode [2019-11-24 06:06:33,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:06:33,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:06:33,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:06:33,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:06:33,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:06:33,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:06:33,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:06:33,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:06:33,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (1/1) ... [2019-11-24 06:06:33,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:06:33,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:06:33,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:06:33,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:06:33,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (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-11-24 06:06:34,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:06:34,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:06:37,127 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:06:37,127 INFO L284 CfgBuilder]: Removed 218 assume(true) statements. [2019-11-24 06:06:37,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:06:37 BoogieIcfgContainer [2019-11-24 06:06:37,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:06:37,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:06:37,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:06:37,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:06:37,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:06:33" (1/3) ... [2019-11-24 06:06:37,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132f2a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:06:37, skipping insertion in model container [2019-11-24 06:06:37,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:06:33" (2/3) ... [2019-11-24 06:06:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132f2a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:06:37, skipping insertion in model container [2019-11-24 06:06:37,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:06:37" (3/3) ... [2019-11-24 06:06:37,139 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2019-11-24 06:06:37,150 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:06:37,159 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:06:37,171 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:06:37,210 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:06:37,211 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:06:37,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:06:37,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:06:37,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:06:37,212 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:06:37,212 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:06:37,212 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:06:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states. [2019-11-24 06:06:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:06:37,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:37,257 INFO L410 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] [2019-11-24 06:06:37,257 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:37,263 INFO L82 PathProgramCache]: Analyzing trace with hash 220312490, now seen corresponding path program 1 times [2019-11-24 06:06:37,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:37,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520836491] [2019-11-24 06:06:37,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:37,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520836491] [2019-11-24 06:06:37,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:37,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:37,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378382029] [2019-11-24 06:06:37,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:37,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:37,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:37,465 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 3 states. [2019-11-24 06:06:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:37,653 INFO L93 Difference]: Finished difference Result 860 states and 1316 transitions. [2019-11-24 06:06:37,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:37,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:06:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:37,684 INFO L225 Difference]: With dead ends: 860 [2019-11-24 06:06:37,685 INFO L226 Difference]: Without dead ends: 558 [2019-11-24 06:06:37,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-24 06:06:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 529. [2019-11-24 06:06:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-11-24 06:06:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 795 transitions. [2019-11-24 06:06:37,787 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 795 transitions. Word has length 36 [2019-11-24 06:06:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:37,787 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 795 transitions. [2019-11-24 06:06:37,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 795 transitions. [2019-11-24 06:06:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:06:37,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:37,790 INFO L410 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] [2019-11-24 06:06:37,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:37,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1271761579, now seen corresponding path program 1 times [2019-11-24 06:06:37,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:37,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242439974] [2019-11-24 06:06:37,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:37,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242439974] [2019-11-24 06:06:37,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:37,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:37,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283400520] [2019-11-24 06:06:37,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:37,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:37,877 INFO L87 Difference]: Start difference. First operand 529 states and 795 transitions. Second operand 3 states. [2019-11-24 06:06:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:38,032 INFO L93 Difference]: Finished difference Result 1481 states and 2224 transitions. [2019-11-24 06:06:38,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:38,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:06:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:38,040 INFO L225 Difference]: With dead ends: 1481 [2019-11-24 06:06:38,040 INFO L226 Difference]: Without dead ends: 961 [2019-11-24 06:06:38,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-11-24 06:06:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 957. [2019-11-24 06:06:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-11-24 06:06:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1422 transitions. [2019-11-24 06:06:38,105 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1422 transitions. Word has length 36 [2019-11-24 06:06:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:38,106 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1422 transitions. [2019-11-24 06:06:38,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1422 transitions. [2019-11-24 06:06:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:06:38,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:38,113 INFO L410 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] [2019-11-24 06:06:38,113 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash 300086892, now seen corresponding path program 1 times [2019-11-24 06:06:38,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:38,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184008897] [2019-11-24 06:06:38,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:38,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184008897] [2019-11-24 06:06:38,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:38,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:38,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764976752] [2019-11-24 06:06:38,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:38,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:38,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:38,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:38,221 INFO L87 Difference]: Start difference. First operand 957 states and 1422 transitions. Second operand 3 states. [2019-11-24 06:06:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:38,326 INFO L93 Difference]: Finished difference Result 2699 states and 4008 transitions. [2019-11-24 06:06:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:38,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:06:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:38,336 INFO L225 Difference]: With dead ends: 2699 [2019-11-24 06:06:38,336 INFO L226 Difference]: Without dead ends: 1754 [2019-11-24 06:06:38,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-11-24 06:06:38,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1748. [2019-11-24 06:06:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2019-11-24 06:06:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2567 transitions. [2019-11-24 06:06:38,392 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2567 transitions. Word has length 36 [2019-11-24 06:06:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:38,392 INFO L462 AbstractCegarLoop]: Abstraction has 1748 states and 2567 transitions. [2019-11-24 06:06:38,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2567 transitions. [2019-11-24 06:06:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:06:38,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:38,396 INFO L410 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] [2019-11-24 06:06:38,397 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 938871371, now seen corresponding path program 1 times [2019-11-24 06:06:38,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:38,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92981415] [2019-11-24 06:06:38,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:38,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92981415] [2019-11-24 06:06:38,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:38,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:38,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961692882] [2019-11-24 06:06:38,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:38,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:38,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:38,518 INFO L87 Difference]: Start difference. First operand 1748 states and 2567 transitions. Second operand 3 states. [2019-11-24 06:06:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:38,655 INFO L93 Difference]: Finished difference Result 4942 states and 7253 transitions. [2019-11-24 06:06:38,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:38,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:06:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:38,671 INFO L225 Difference]: With dead ends: 4942 [2019-11-24 06:06:38,671 INFO L226 Difference]: Without dead ends: 3213 [2019-11-24 06:06:38,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2019-11-24 06:06:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3203. [2019-11-24 06:06:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3203 states. [2019-11-24 06:06:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 3203 states and 4648 transitions. [2019-11-24 06:06:38,771 INFO L78 Accepts]: Start accepts. Automaton has 3203 states and 4648 transitions. Word has length 36 [2019-11-24 06:06:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:38,771 INFO L462 AbstractCegarLoop]: Abstraction has 3203 states and 4648 transitions. [2019-11-24 06:06:38,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3203 states and 4648 transitions. [2019-11-24 06:06:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 06:06:38,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:38,772 INFO L410 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] [2019-11-24 06:06:38,773 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1600205162, now seen corresponding path program 1 times [2019-11-24 06:06:38,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:38,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840988772] [2019-11-24 06:06:38,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:38,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840988772] [2019-11-24 06:06:38,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:38,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:38,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107432049] [2019-11-24 06:06:38,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:38,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:38,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:38,852 INFO L87 Difference]: Start difference. First operand 3203 states and 4648 transitions. Second operand 3 states. [2019-11-24 06:06:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:39,120 INFO L93 Difference]: Finished difference Result 9447 states and 13659 transitions. [2019-11-24 06:06:39,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:39,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 06:06:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:39,151 INFO L225 Difference]: With dead ends: 9447 [2019-11-24 06:06:39,151 INFO L226 Difference]: Without dead ends: 6266 [2019-11-24 06:06:39,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:06:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2019-11-24 06:06:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 6250. [2019-11-24 06:06:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6250 states. [2019-11-24 06:06:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6250 states to 6250 states and 8909 transitions. [2019-11-24 06:06:39,393 INFO L78 Accepts]: Start accepts. Automaton has 6250 states and 8909 transitions. Word has length 36 [2019-11-24 06:06:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:39,394 INFO L462 AbstractCegarLoop]: Abstraction has 6250 states and 8909 transitions. [2019-11-24 06:06:39,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6250 states and 8909 transitions. [2019-11-24 06:06:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 06:06:39,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:39,398 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-11-24 06:06:39,398 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1901365473, now seen corresponding path program 1 times [2019-11-24 06:06:39,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:39,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158775861] [2019-11-24 06:06:39,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:39,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158775861] [2019-11-24 06:06:39,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:39,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:39,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999164275] [2019-11-24 06:06:39,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:39,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:39,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:39,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:39,469 INFO L87 Difference]: Start difference. First operand 6250 states and 8909 transitions. Second operand 4 states. [2019-11-24 06:06:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:40,048 INFO L93 Difference]: Finished difference Result 20292 states and 29094 transitions. [2019-11-24 06:06:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:40,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-24 06:06:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:40,116 INFO L225 Difference]: With dead ends: 20292 [2019-11-24 06:06:40,116 INFO L226 Difference]: Without dead ends: 14066 [2019-11-24 06:06:40,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14066 states. [2019-11-24 06:06:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14066 to 7210. [2019-11-24 06:06:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7210 states. [2019-11-24 06:06:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7210 states to 7210 states and 10589 transitions. [2019-11-24 06:06:40,594 INFO L78 Accepts]: Start accepts. Automaton has 7210 states and 10589 transitions. Word has length 48 [2019-11-24 06:06:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:40,595 INFO L462 AbstractCegarLoop]: Abstraction has 7210 states and 10589 transitions. [2019-11-24 06:06:40,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7210 states and 10589 transitions. [2019-11-24 06:06:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 06:06:40,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:40,610 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:06:40,611 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:40,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2099897437, now seen corresponding path program 1 times [2019-11-24 06:06:40,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:40,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728209085] [2019-11-24 06:06:40,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:40,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728209085] [2019-11-24 06:06:40,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:40,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:40,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799614519] [2019-11-24 06:06:40,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:40,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:40,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:40,676 INFO L87 Difference]: Start difference. First operand 7210 states and 10589 transitions. Second operand 3 states. [2019-11-24 06:06:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:41,228 INFO L93 Difference]: Finished difference Result 16806 states and 25111 transitions. [2019-11-24 06:06:41,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:41,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 06:06:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:41,276 INFO L225 Difference]: With dead ends: 16806 [2019-11-24 06:06:41,277 INFO L226 Difference]: Without dead ends: 9620 [2019-11-24 06:06:41,288 INFO L630 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-11-24 06:06:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9620 states. [2019-11-24 06:06:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9620 to 9066. [2019-11-24 06:06:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-11-24 06:06:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 13789 transitions. [2019-11-24 06:06:41,787 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 13789 transitions. Word has length 73 [2019-11-24 06:06:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:41,788 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 13789 transitions. [2019-11-24 06:06:41,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 13789 transitions. [2019-11-24 06:06:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 06:06:41,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:41,808 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:06:41,808 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash 280935967, now seen corresponding path program 1 times [2019-11-24 06:06:41,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:41,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338887240] [2019-11-24 06:06:41,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:41,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338887240] [2019-11-24 06:06:41,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:41,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:41,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211094882] [2019-11-24 06:06:41,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:41,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:41,893 INFO L87 Difference]: Start difference. First operand 9066 states and 13789 transitions. Second operand 3 states. [2019-11-24 06:06:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:42,614 INFO L93 Difference]: Finished difference Result 24006 states and 36903 transitions. [2019-11-24 06:06:42,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:42,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 06:06:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:42,803 INFO L225 Difference]: With dead ends: 24006 [2019-11-24 06:06:42,804 INFO L226 Difference]: Without dead ends: 14964 [2019-11-24 06:06:42,817 INFO L630 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-11-24 06:06:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14964 states. [2019-11-24 06:06:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14964 to 12426. [2019-11-24 06:06:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12426 states. [2019-11-24 06:06:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12426 states to 12426 states and 19517 transitions. [2019-11-24 06:06:43,432 INFO L78 Accepts]: Start accepts. Automaton has 12426 states and 19517 transitions. Word has length 73 [2019-11-24 06:06:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:43,433 INFO L462 AbstractCegarLoop]: Abstraction has 12426 states and 19517 transitions. [2019-11-24 06:06:43,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12426 states and 19517 transitions. [2019-11-24 06:06:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 06:06:43,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:43,455 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:06:43,455 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 565298643, now seen corresponding path program 1 times [2019-11-24 06:06:43,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:43,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345895608] [2019-11-24 06:06:43,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:43,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345895608] [2019-11-24 06:06:43,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:43,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:43,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976902708] [2019-11-24 06:06:43,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:43,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:43,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:43,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:43,528 INFO L87 Difference]: Start difference. First operand 12426 states and 19517 transitions. Second operand 3 states. [2019-11-24 06:06:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:44,742 INFO L93 Difference]: Finished difference Result 32150 states and 51223 transitions. [2019-11-24 06:06:44,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:44,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 06:06:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:44,793 INFO L225 Difference]: With dead ends: 32150 [2019-11-24 06:06:44,794 INFO L226 Difference]: Without dead ends: 19748 [2019-11-24 06:06:44,814 INFO L630 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-11-24 06:06:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19748 states. [2019-11-24 06:06:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19748 to 18634. [2019-11-24 06:06:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18634 states. [2019-11-24 06:06:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18634 states to 18634 states and 29949 transitions. [2019-11-24 06:06:45,708 INFO L78 Accepts]: Start accepts. Automaton has 18634 states and 29949 transitions. Word has length 73 [2019-11-24 06:06:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:45,708 INFO L462 AbstractCegarLoop]: Abstraction has 18634 states and 29949 transitions. [2019-11-24 06:06:45,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18634 states and 29949 transitions. [2019-11-24 06:06:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 06:06:45,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:45,733 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-11-24 06:06:45,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash -6880668, now seen corresponding path program 1 times [2019-11-24 06:06:45,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:45,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683412411] [2019-11-24 06:06:45,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:45,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683412411] [2019-11-24 06:06:45,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:45,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:45,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831504150] [2019-11-24 06:06:45,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:45,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:45,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:45,787 INFO L87 Difference]: Start difference. First operand 18634 states and 29949 transitions. Second operand 3 states. [2019-11-24 06:06:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:46,973 INFO L93 Difference]: Finished difference Result 55312 states and 88995 transitions. [2019-11-24 06:06:46,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:46,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-24 06:06:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:47,095 INFO L225 Difference]: With dead ends: 55312 [2019-11-24 06:06:47,097 INFO L226 Difference]: Without dead ends: 36683 [2019-11-24 06:06:47,141 INFO L630 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-11-24 06:06:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36683 states. [2019-11-24 06:06:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36683 to 36009. [2019-11-24 06:06:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36009 states. [2019-11-24 06:06:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36009 states to 36009 states and 57770 transitions. [2019-11-24 06:06:50,281 INFO L78 Accepts]: Start accepts. Automaton has 36009 states and 57770 transitions. Word has length 74 [2019-11-24 06:06:50,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:50,282 INFO L462 AbstractCegarLoop]: Abstraction has 36009 states and 57770 transitions. [2019-11-24 06:06:50,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 36009 states and 57770 transitions. [2019-11-24 06:06:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 06:06:50,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:50,327 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-11-24 06:06:50,327 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash -978555355, now seen corresponding path program 1 times [2019-11-24 06:06:50,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:50,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467968050] [2019-11-24 06:06:50,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:50,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467968050] [2019-11-24 06:06:50,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:50,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:06:50,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419924169] [2019-11-24 06:06:50,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:50,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:50,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:50,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:50,409 INFO L87 Difference]: Start difference. First operand 36009 states and 57770 transitions. Second operand 3 states. [2019-11-24 06:06:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:51,429 INFO L93 Difference]: Finished difference Result 54347 states and 87419 transitions. [2019-11-24 06:06:51,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:51,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-24 06:06:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:51,642 INFO L225 Difference]: With dead ends: 54347 [2019-11-24 06:06:51,642 INFO L226 Difference]: Without dead ends: 36009 [2019-11-24 06:06:51,664 INFO L630 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-11-24 06:06:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36009 states. [2019-11-24 06:06:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36009 to 35499. [2019-11-24 06:06:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35499 states. [2019-11-24 06:06:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35499 states to 35499 states and 56572 transitions. [2019-11-24 06:06:52,850 INFO L78 Accepts]: Start accepts. Automaton has 35499 states and 56572 transitions. Word has length 74 [2019-11-24 06:06:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:52,850 INFO L462 AbstractCegarLoop]: Abstraction has 35499 states and 56572 transitions. [2019-11-24 06:06:52,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 35499 states and 56572 transitions. [2019-11-24 06:06:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-24 06:06:52,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:52,902 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-11-24 06:06:52,902 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash 25805766, now seen corresponding path program 1 times [2019-11-24 06:06:52,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:52,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54864538] [2019-11-24 06:06:52,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:06:52,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54864538] [2019-11-24 06:06:52,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:52,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:06:52,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017554763] [2019-11-24 06:06:52,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:06:52,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:52,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:06:52,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:06:52,975 INFO L87 Difference]: Start difference. First operand 35499 states and 56572 transitions. Second operand 3 states. [2019-11-24 06:06:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:53,702 INFO L93 Difference]: Finished difference Result 53071 states and 84767 transitions. [2019-11-24 06:06:53,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:06:53,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-24 06:06:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:53,791 INFO L225 Difference]: With dead ends: 53071 [2019-11-24 06:06:53,791 INFO L226 Difference]: Without dead ends: 35499 [2019-11-24 06:06:53,816 INFO L630 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-11-24 06:06:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35499 states. [2019-11-24 06:06:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35499 to 35499. [2019-11-24 06:06:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35499 states. [2019-11-24 06:06:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35499 states to 35499 states and 56412 transitions. [2019-11-24 06:06:55,787 INFO L78 Accepts]: Start accepts. Automaton has 35499 states and 56412 transitions. Word has length 74 [2019-11-24 06:06:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:55,787 INFO L462 AbstractCegarLoop]: Abstraction has 35499 states and 56412 transitions. [2019-11-24 06:06:55,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:06:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35499 states and 56412 transitions. [2019-11-24 06:06:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:06:55,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:55,806 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-11-24 06:06:55,807 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash -197110756, now seen corresponding path program 1 times [2019-11-24 06:06:55,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:55,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621778515] [2019-11-24 06:06:55,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:55,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621778515] [2019-11-24 06:06:55,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:55,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:55,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327313430] [2019-11-24 06:06:55,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:55,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:55,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:55,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:55,889 INFO L87 Difference]: Start difference. First operand 35499 states and 56412 transitions. Second operand 4 states. [2019-11-24 06:06:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:06:57,951 INFO L93 Difference]: Finished difference Result 101383 states and 159679 transitions. [2019-11-24 06:06:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:06:57,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-24 06:06:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:06:57,995 INFO L225 Difference]: With dead ends: 101383 [2019-11-24 06:06:57,996 INFO L226 Difference]: Without dead ends: 41859 [2019-11-24 06:06:58,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41859 states. [2019-11-24 06:06:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41859 to 28659. [2019-11-24 06:06:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28659 states. [2019-11-24 06:06:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28659 states to 28659 states and 43532 transitions. [2019-11-24 06:06:58,826 INFO L78 Accepts]: Start accepts. Automaton has 28659 states and 43532 transitions. Word has length 75 [2019-11-24 06:06:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:06:58,827 INFO L462 AbstractCegarLoop]: Abstraction has 28659 states and 43532 transitions. [2019-11-24 06:06:58,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:06:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 28659 states and 43532 transitions. [2019-11-24 06:06:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-24 06:06:58,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:06:58,840 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-11-24 06:06:58,840 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:06:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:06:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1864304631, now seen corresponding path program 1 times [2019-11-24 06:06:58,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:06:58,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014100652] [2019-11-24 06:06:58,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:06:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:06:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:06:58,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014100652] [2019-11-24 06:06:58,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:06:58,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:06:58,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373793678] [2019-11-24 06:06:58,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:06:58,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:06:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:06:58,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:06:58,891 INFO L87 Difference]: Start difference. First operand 28659 states and 43532 transitions. Second operand 4 states. [2019-11-24 06:07:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:00,939 INFO L93 Difference]: Finished difference Result 91975 states and 141365 transitions. [2019-11-24 06:07:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:07:00,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-24 06:07:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:01,010 INFO L225 Difference]: With dead ends: 91975 [2019-11-24 06:07:01,010 INFO L226 Difference]: Without dead ends: 63339 [2019-11-24 06:07:01,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:07:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63339 states. [2019-11-24 06:07:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63339 to 42995. [2019-11-24 06:07:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42995 states. [2019-11-24 06:07:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42995 states to 42995 states and 66860 transitions. [2019-11-24 06:07:02,424 INFO L78 Accepts]: Start accepts. Automaton has 42995 states and 66860 transitions. Word has length 76 [2019-11-24 06:07:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:02,424 INFO L462 AbstractCegarLoop]: Abstraction has 42995 states and 66860 transitions. [2019-11-24 06:07:02,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:07:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 42995 states and 66860 transitions. [2019-11-24 06:07:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-24 06:07:02,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:02,465 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-11-24 06:07:02,465 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash 11053880, now seen corresponding path program 1 times [2019-11-24 06:07:02,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:02,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383296787] [2019-11-24 06:07:02,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:07:02,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383296787] [2019-11-24 06:07:02,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:02,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:07:02,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569796991] [2019-11-24 06:07:02,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:07:02,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:07:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:02,523 INFO L87 Difference]: Start difference. First operand 42995 states and 66860 transitions. Second operand 3 states. [2019-11-24 06:07:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:04,014 INFO L93 Difference]: Finished difference Result 69487 states and 108335 transitions. [2019-11-24 06:07:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:07:04,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-24 06:07:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:04,060 INFO L225 Difference]: With dead ends: 69487 [2019-11-24 06:07:04,060 INFO L226 Difference]: Without dead ends: 42995 [2019-11-24 06:07:04,081 INFO L630 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-11-24 06:07:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42995 states. [2019-11-24 06:07:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42995 to 42995. [2019-11-24 06:07:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42995 states. [2019-11-24 06:07:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42995 states to 42995 states and 66620 transitions. [2019-11-24 06:07:06,598 INFO L78 Accepts]: Start accepts. Automaton has 42995 states and 66620 transitions. Word has length 103 [2019-11-24 06:07:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:06,598 INFO L462 AbstractCegarLoop]: Abstraction has 42995 states and 66620 transitions. [2019-11-24 06:07:06,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:07:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 42995 states and 66620 transitions. [2019-11-24 06:07:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-24 06:07:06,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:06,634 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-11-24 06:07:06,635 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:06,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash 621389656, now seen corresponding path program 1 times [2019-11-24 06:07:06,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:06,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797270969] [2019-11-24 06:07:06,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:07:06,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797270969] [2019-11-24 06:07:06,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:06,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:07:06,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010604091] [2019-11-24 06:07:06,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:07:06,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:06,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:07:06,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:06,687 INFO L87 Difference]: Start difference. First operand 42995 states and 66620 transitions. Second operand 3 states. [2019-11-24 06:07:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:08,065 INFO L93 Difference]: Finished difference Result 69407 states and 107775 transitions. [2019-11-24 06:07:08,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:07:08,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-24 06:07:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:08,106 INFO L225 Difference]: With dead ends: 69407 [2019-11-24 06:07:08,106 INFO L226 Difference]: Without dead ends: 42915 [2019-11-24 06:07:08,121 INFO L630 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-11-24 06:07:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42915 states. [2019-11-24 06:07:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42915 to 42211. [2019-11-24 06:07:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42211 states. [2019-11-24 06:07:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42211 states to 42211 states and 64780 transitions. [2019-11-24 06:07:09,279 INFO L78 Accepts]: Start accepts. Automaton has 42211 states and 64780 transitions. Word has length 103 [2019-11-24 06:07:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:09,279 INFO L462 AbstractCegarLoop]: Abstraction has 42211 states and 64780 transitions. [2019-11-24 06:07:09,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:07:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 42211 states and 64780 transitions. [2019-11-24 06:07:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-24 06:07:09,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:09,306 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-11-24 06:07:09,306 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1080118743, now seen corresponding path program 1 times [2019-11-24 06:07:09,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:09,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412276537] [2019-11-24 06:07:09,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 06:07:09,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412276537] [2019-11-24 06:07:09,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:09,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:07:09,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110823655] [2019-11-24 06:07:09,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:07:09,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:07:09,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:09,358 INFO L87 Difference]: Start difference. First operand 42211 states and 64780 transitions. Second operand 3 states. [2019-11-24 06:07:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:11,631 INFO L93 Difference]: Finished difference Result 123571 states and 189738 transitions. [2019-11-24 06:07:11,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:07:11,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-24 06:07:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:11,720 INFO L225 Difference]: With dead ends: 123571 [2019-11-24 06:07:11,720 INFO L226 Difference]: Without dead ends: 81374 [2019-11-24 06:07:11,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-24 06:07:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81374 states. [2019-11-24 06:07:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81374 to 80730. [2019-11-24 06:07:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80730 states. [2019-11-24 06:07:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80730 states to 80730 states and 123321 transitions. [2019-11-24 06:07:16,174 INFO L78 Accepts]: Start accepts. Automaton has 80730 states and 123321 transitions. Word has length 104 [2019-11-24 06:07:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:16,175 INFO L462 AbstractCegarLoop]: Abstraction has 80730 states and 123321 transitions. [2019-11-24 06:07:16,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:07:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 80730 states and 123321 transitions. [2019-11-24 06:07:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-24 06:07:16,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:16,224 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-11-24 06:07:16,224 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 70643803, now seen corresponding path program 1 times [2019-11-24 06:07:16,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:16,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832664106] [2019-11-24 06:07:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:07:16,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832664106] [2019-11-24 06:07:16,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:16,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:07:16,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301281212] [2019-11-24 06:07:16,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:07:16,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:07:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:07:16,292 INFO L87 Difference]: Start difference. First operand 80730 states and 123321 transitions. Second operand 5 states. [2019-11-24 06:07:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:19,513 INFO L93 Difference]: Finished difference Result 165282 states and 250461 transitions. [2019-11-24 06:07:19,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:07:19,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-24 06:07:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:19,632 INFO L225 Difference]: With dead ends: 165282 [2019-11-24 06:07:19,632 INFO L226 Difference]: Without dead ends: 116558 [2019-11-24 06:07:19,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:07:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116558 states. [2019-11-24 06:07:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116558 to 81578. [2019-11-24 06:07:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81578 states. [2019-11-24 06:07:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81578 states to 81578 states and 123081 transitions. [2019-11-24 06:07:22,507 INFO L78 Accepts]: Start accepts. Automaton has 81578 states and 123081 transitions. Word has length 105 [2019-11-24 06:07:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:22,507 INFO L462 AbstractCegarLoop]: Abstraction has 81578 states and 123081 transitions. [2019-11-24 06:07:22,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:07:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 81578 states and 123081 transitions. [2019-11-24 06:07:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 06:07:22,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:22,561 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:07:22,561 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1966197495, now seen corresponding path program 1 times [2019-11-24 06:07:22,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:22,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439554466] [2019-11-24 06:07:22,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:07:22,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439554466] [2019-11-24 06:07:22,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:22,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:07:22,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185571211] [2019-11-24 06:07:22,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:07:22,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:22,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:07:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:22,623 INFO L87 Difference]: Start difference. First operand 81578 states and 123081 transitions. Second operand 3 states. [2019-11-24 06:07:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:25,275 INFO L93 Difference]: Finished difference Result 138590 states and 209788 transitions. [2019-11-24 06:07:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:07:25,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-24 06:07:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:25,361 INFO L225 Difference]: With dead ends: 138590 [2019-11-24 06:07:25,361 INFO L226 Difference]: Without dead ends: 81258 [2019-11-24 06:07:25,403 INFO L630 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-11-24 06:07:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81258 states. [2019-11-24 06:07:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81258 to 79786. [2019-11-24 06:07:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79786 states. [2019-11-24 06:07:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79786 states to 79786 states and 118937 transitions. [2019-11-24 06:07:29,807 INFO L78 Accepts]: Start accepts. Automaton has 79786 states and 118937 transitions. Word has length 134 [2019-11-24 06:07:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:29,807 INFO L462 AbstractCegarLoop]: Abstraction has 79786 states and 118937 transitions. [2019-11-24 06:07:29,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:07:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 79786 states and 118937 transitions. [2019-11-24 06:07:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-24 06:07:30,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:30,145 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:07:30,145 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:30,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash -514954101, now seen corresponding path program 1 times [2019-11-24 06:07:30,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:30,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924127620] [2019-11-24 06:07:30,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:07:30,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924127620] [2019-11-24 06:07:30,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:30,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:07:30,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662916785] [2019-11-24 06:07:30,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:07:30,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:30,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:07:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:30,200 INFO L87 Difference]: Start difference. First operand 79786 states and 118937 transitions. Second operand 3 states. [2019-11-24 06:07:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:33,094 INFO L93 Difference]: Finished difference Result 135006 states and 201500 transitions. [2019-11-24 06:07:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:07:33,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-24 06:07:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:33,168 INFO L225 Difference]: With dead ends: 135006 [2019-11-24 06:07:33,168 INFO L226 Difference]: Without dead ends: 79786 [2019-11-24 06:07:33,197 INFO L630 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-11-24 06:07:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79786 states. [2019-11-24 06:07:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79786 to 79786. [2019-11-24 06:07:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79786 states. [2019-11-24 06:07:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79786 states to 79786 states and 118313 transitions. [2019-11-24 06:07:37,959 INFO L78 Accepts]: Start accepts. Automaton has 79786 states and 118313 transitions. Word has length 134 [2019-11-24 06:07:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:37,959 INFO L462 AbstractCegarLoop]: Abstraction has 79786 states and 118313 transitions. [2019-11-24 06:07:37,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:07:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 79786 states and 118313 transitions. [2019-11-24 06:07:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-24 06:07:38,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:38,011 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:07:38,011 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1498329317, now seen corresponding path program 1 times [2019-11-24 06:07:38,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:38,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592967500] [2019-11-24 06:07:38,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 06:07:38,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592967500] [2019-11-24 06:07:38,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:38,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:07:38,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181927714] [2019-11-24 06:07:38,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:07:38,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:38,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:07:38,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:38,092 INFO L87 Difference]: Start difference. First operand 79786 states and 118313 transitions. Second operand 3 states. [2019-11-24 06:07:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:07:43,176 INFO L93 Difference]: Finished difference Result 197042 states and 293815 transitions. [2019-11-24 06:07:43,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:07:43,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-24 06:07:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:07:43,329 INFO L225 Difference]: With dead ends: 197042 [2019-11-24 06:07:43,329 INFO L226 Difference]: Without dead ends: 154766 [2019-11-24 06:07:43,369 INFO L630 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-11-24 06:07:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154766 states. [2019-11-24 06:07:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154766 to 154762. [2019-11-24 06:07:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154762 states. [2019-11-24 06:07:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154762 states to 154762 states and 230625 transitions. [2019-11-24 06:07:49,183 INFO L78 Accepts]: Start accepts. Automaton has 154762 states and 230625 transitions. Word has length 137 [2019-11-24 06:07:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:07:49,183 INFO L462 AbstractCegarLoop]: Abstraction has 154762 states and 230625 transitions. [2019-11-24 06:07:49,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:07:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 154762 states and 230625 transitions. [2019-11-24 06:07:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-24 06:07:49,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:07:49,275 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:07:49,275 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:07:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:07:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash 766921959, now seen corresponding path program 1 times [2019-11-24 06:07:49,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:07:49,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487168589] [2019-11-24 06:07:49,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:07:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:07:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:07:49,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487168589] [2019-11-24 06:07:49,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:07:49,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:07:49,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783743486] [2019-11-24 06:07:49,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:07:49,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:07:49,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:07:49,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:07:49,340 INFO L87 Difference]: Start difference. First operand 154762 states and 230625 transitions. Second operand 3 states.