./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57b9f50bcc1a62fff86b613ffbbe182d8b5828efa44efacd776b022a56af4d4d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:28:56,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:28:56,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:28:56,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:28:56,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:28:56,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:28:56,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:28:56,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:28:56,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:28:56,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:28:56,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:28:56,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:28:56,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:28:56,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:28:56,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:28:56,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:28:56,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:28:56,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:28:56,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:28:56,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:28:56,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:28:56,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:28:56,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:28:56,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:28:56,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:28:56,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:28:56,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:28:56,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:28:56,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:28:56,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:28:56,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:28:56,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:28:56,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:28:56,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:28:56,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:28:56,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:28:56,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:28:56,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:28:56,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:28:56,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:28:56,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:28:56,241 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 05:28:56,284 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:28:56,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:28:56,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:28:56,286 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:28:56,286 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:28:56,286 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:28:56,286 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:28:56,287 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:28:56,287 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:28:56,287 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:28:56,291 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:28:56,291 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:28:56,292 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:28:56,292 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:28:56,292 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:28:56,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:28:56,293 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:28:56,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:28:56,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:28:56,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:28:56,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:28:56,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:28:56,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:28:56,294 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:28:56,295 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:28:56,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:28:56,295 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:28:56,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:28:56,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:28:56,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:28:56,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:28:56,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:28:56,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:28:56,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:28:56,298 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:28:56,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:28:56,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:28:56,299 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:28:56,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:28:56,299 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57b9f50bcc1a62fff86b613ffbbe182d8b5828efa44efacd776b022a56af4d4d [2021-11-03 05:28:56,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:28:56,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:28:56,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:28:56,555 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:28:56,555 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:28:56,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2021-11-03 05:28:56,635 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/data/51c07b280/e233d800ebb74428b4301b4383fb042a/FLAG59cc5c0aa [2021-11-03 05:28:57,162 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:28:57,163 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2021-11-03 05:28:57,177 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/data/51c07b280/e233d800ebb74428b4301b4383fb042a/FLAG59cc5c0aa [2021-11-03 05:28:57,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/data/51c07b280/e233d800ebb74428b4301b4383fb042a [2021-11-03 05:28:57,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:28:57,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:28:57,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:28:57,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:28:57,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:28:57,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:57,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20792ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57, skipping insertion in model container [2021-11-03 05:28:57,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:57,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:28:57,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:28:57,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c[3526,3539] [2021-11-03 05:28:57,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:28:57,823 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:28:57,868 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c[3526,3539] [2021-11-03 05:28:57,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:28:57,890 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:28:57,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57 WrapperNode [2021-11-03 05:28:57,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:28:57,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:28:57,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:28:57,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:28:57,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:57,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:57,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:28:57,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:28:57,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:28:57,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:28:57,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:57,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:57,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:57,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:57,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:58,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:58,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:58,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:28:58,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:28:58,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:28:58,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:28:58,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (1/1) ... [2021-11-03 05:28:58,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:28:58,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:28:58,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:28:58,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:28:58,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-03 05:28:58,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-03 05:28:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-03 05:28:58,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-03 05:28:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-03 05:28:58,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-03 05:28:58,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-11-03 05:28:58,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-11-03 05:28:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:28:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:28:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 05:28:58,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-03 05:28:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-03 05:28:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:28:58,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:28:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 05:28:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:28:58,089 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-03 05:28:58,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:28:58,696 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-11-03 05:28:58,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:28:58 BoogieIcfgContainer [2021-11-03 05:28:58,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:28:58,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:28:58,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:28:58,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:28:58,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:28:57" (1/3) ... [2021-11-03 05:28:58,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bf4ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:28:58, skipping insertion in model container [2021-11-03 05:28:58,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:28:57" (2/3) ... [2021-11-03 05:28:58,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bf4ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:28:58, skipping insertion in model container [2021-11-03 05:28:58,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:28:58" (3/3) ... [2021-11-03 05:28:58,708 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2021-11-03 05:28:58,713 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-03 05:28:58,713 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:28:58,713 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 05:28:58,713 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-03 05:28:58,751 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,752 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,752 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,752 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,752 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,753 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,753 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,753 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,753 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,754 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,754 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,754 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,755 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,755 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,755 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,755 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,755 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,756 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,756 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,756 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,757 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,757 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,757 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,757 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,758 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,758 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,758 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,758 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,758 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,759 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,759 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,759 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,760 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,760 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,760 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,760 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,761 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,761 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,761 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,761 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,761 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,762 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,762 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,762 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,762 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,763 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,763 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,763 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,766 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,766 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,766 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,766 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,767 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,767 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,769 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,769 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,769 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,770 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,770 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,770 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,772 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,772 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,772 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,772 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,772 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,773 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,775 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,775 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,776 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:28:58,785 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-11-03 05:28:58,830 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:28:58,837 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:28:58,837 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-03 05:28:58,854 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-03 05:28:58,863 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 134 transitions, 300 flow [2021-11-03 05:28:58,866 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 134 transitions, 300 flow [2021-11-03 05:28:58,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 300 flow [2021-11-03 05:28:58,973 INFO L129 PetriNetUnfolder]: 2/130 cut-off events. [2021-11-03 05:28:58,973 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-11-03 05:28:58,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 130 events. 2/130 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2021-11-03 05:28:58,984 INFO L116 LiptonReduction]: Number of co-enabled transitions 1302 [2021-11-03 05:29:05,015 INFO L131 LiptonReduction]: Checked pairs total: 3127 [2021-11-03 05:29:05,015 INFO L133 LiptonReduction]: Total number of compositions: 109 [2021-11-03 05:29:05,029 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 94 flow [2021-11-03 05:29:05,100 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 402 states, 401 states have (on average 3.027431421446384) internal successors, (1214), 401 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 402 states, 401 states have (on average 3.027431421446384) internal successors, (1214), 401 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:05,135 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:05,136 INFO L513 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] [2021-11-03 05:29:05,137 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1792856431, now seen corresponding path program 1 times [2021-11-03 05:29:05,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:05,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123176642] [2021-11-03 05:29:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:05,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:05,996 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:05,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123176642] [2021-11-03 05:29:05,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123176642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:05,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:05,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:29:06,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746990852] [2021-11-03 05:29:06,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:29:06,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:06,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:29:06,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:29:06,021 INFO L87 Difference]: Start difference. First operand has 402 states, 401 states have (on average 3.027431421446384) internal successors, (1214), 401 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:06,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:06,224 INFO L93 Difference]: Finished difference Result 623 states and 1815 transitions. [2021-11-03 05:29:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:29:06,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:06,254 INFO L225 Difference]: With dead ends: 623 [2021-11-03 05:29:06,255 INFO L226 Difference]: Without dead ends: 526 [2021-11-03 05:29:06,256 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:06,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-11-03 05:29:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2021-11-03 05:29:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 2.9771428571428573) internal successors, (1563), 525 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1563 transitions. [2021-11-03 05:29:06,342 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1563 transitions. Word has length 26 [2021-11-03 05:29:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:06,342 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 1563 transitions. [2021-11-03 05:29:06,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1563 transitions. [2021-11-03 05:29:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:06,346 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:06,346 INFO L513 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] [2021-11-03 05:29:06,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:29:06,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1537703415, now seen corresponding path program 2 times [2021-11-03 05:29:06,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:06,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731680223] [2021-11-03 05:29:06,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:06,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:06,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:06,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731680223] [2021-11-03 05:29:06,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731680223] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:06,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:06,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:29:06,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011809565] [2021-11-03 05:29:06,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:29:06,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:06,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:29:06,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:29:06,534 INFO L87 Difference]: Start difference. First operand 526 states and 1563 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:06,703 INFO L93 Difference]: Finished difference Result 1096 states and 3000 transitions. [2021-11-03 05:29:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:29:06,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:06,717 INFO L225 Difference]: With dead ends: 1096 [2021-11-03 05:29:06,717 INFO L226 Difference]: Without dead ends: 1088 [2021-11-03 05:29:06,718 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-11-03 05:29:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 680. [2021-11-03 05:29:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 2.893961708394698) internal successors, (1965), 679 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1965 transitions. [2021-11-03 05:29:06,782 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1965 transitions. Word has length 26 [2021-11-03 05:29:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:06,783 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1965 transitions. [2021-11-03 05:29:06,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1965 transitions. [2021-11-03 05:29:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:06,787 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:06,787 INFO L513 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] [2021-11-03 05:29:06,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:29:06,788 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2052734287, now seen corresponding path program 3 times [2021-11-03 05:29:06,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:06,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124842441] [2021-11-03 05:29:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:06,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:07,047 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:07,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124842441] [2021-11-03 05:29:07,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124842441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:07,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:07,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:29:07,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727753185] [2021-11-03 05:29:07,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:29:07,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:07,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:29:07,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:29:07,055 INFO L87 Difference]: Start difference. First operand 680 states and 1965 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:07,259 INFO L93 Difference]: Finished difference Result 1050 states and 2888 transitions. [2021-11-03 05:29:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:29:07,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:07,269 INFO L225 Difference]: With dead ends: 1050 [2021-11-03 05:29:07,270 INFO L226 Difference]: Without dead ends: 1038 [2021-11-03 05:29:07,270 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:29:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-11-03 05:29:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 750. [2021-11-03 05:29:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 2.897196261682243) internal successors, (2170), 749 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 2170 transitions. [2021-11-03 05:29:07,312 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 2170 transitions. Word has length 26 [2021-11-03 05:29:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:07,313 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 2170 transitions. [2021-11-03 05:29:07,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 2170 transitions. [2021-11-03 05:29:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:07,318 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:07,318 INFO L513 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] [2021-11-03 05:29:07,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 05:29:07,325 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:07,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:07,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1273929913, now seen corresponding path program 4 times [2021-11-03 05:29:07,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:07,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523655387] [2021-11-03 05:29:07,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:07,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:07,519 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:07,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523655387] [2021-11-03 05:29:07,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523655387] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:07,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:07,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:29:07,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267969201] [2021-11-03 05:29:07,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:29:07,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:29:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:29:07,522 INFO L87 Difference]: Start difference. First operand 750 states and 2170 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:07,669 INFO L93 Difference]: Finished difference Result 1164 states and 3149 transitions. [2021-11-03 05:29:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:29:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:07,679 INFO L225 Difference]: With dead ends: 1164 [2021-11-03 05:29:07,679 INFO L226 Difference]: Without dead ends: 1132 [2021-11-03 05:29:07,679 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-11-03 05:29:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 788. [2021-11-03 05:29:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 2.8475222363405335) internal successors, (2241), 787 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2241 transitions. [2021-11-03 05:29:07,716 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 2241 transitions. Word has length 26 [2021-11-03 05:29:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:07,717 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 2241 transitions. [2021-11-03 05:29:07,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 2241 transitions. [2021-11-03 05:29:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:07,720 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:07,720 INFO L513 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] [2021-11-03 05:29:07,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:29:07,721 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -147318863, now seen corresponding path program 5 times [2021-11-03 05:29:07,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:07,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592844398] [2021-11-03 05:29:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:07,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:07,852 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:07,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592844398] [2021-11-03 05:29:07,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592844398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:07,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:07,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:29:07,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445981057] [2021-11-03 05:29:07,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:29:07,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:07,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:29:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:29:07,854 INFO L87 Difference]: Start difference. First operand 788 states and 2241 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:07,960 INFO L93 Difference]: Finished difference Result 1092 states and 2874 transitions. [2021-11-03 05:29:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:29:07,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:07,970 INFO L225 Difference]: With dead ends: 1092 [2021-11-03 05:29:07,970 INFO L226 Difference]: Without dead ends: 1078 [2021-11-03 05:29:07,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-11-03 05:29:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 820. [2021-11-03 05:29:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 819 states have (on average 2.752136752136752) internal successors, (2254), 819 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 2254 transitions. [2021-11-03 05:29:08,010 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 2254 transitions. Word has length 26 [2021-11-03 05:29:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:08,010 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 2254 transitions. [2021-11-03 05:29:08,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 2254 transitions. [2021-11-03 05:29:08,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:08,015 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:08,015 INFO L513 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] [2021-11-03 05:29:08,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:29:08,016 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash 28436583, now seen corresponding path program 6 times [2021-11-03 05:29:08,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:08,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782958854] [2021-11-03 05:29:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:08,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:08,122 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:08,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782958854] [2021-11-03 05:29:08,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782958854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:08,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:08,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:29:08,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998527234] [2021-11-03 05:29:08,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:29:08,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:29:08,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:29:08,125 INFO L87 Difference]: Start difference. First operand 820 states and 2254 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:08,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:08,294 INFO L93 Difference]: Finished difference Result 1118 states and 2921 transitions. [2021-11-03 05:29:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:29:08,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:08,304 INFO L225 Difference]: With dead ends: 1118 [2021-11-03 05:29:08,305 INFO L226 Difference]: Without dead ends: 1110 [2021-11-03 05:29:08,305 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:29:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2021-11-03 05:29:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 824. [2021-11-03 05:29:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 2.72539489671932) internal successors, (2243), 823 states have internal predecessors, (2243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2243 transitions. [2021-11-03 05:29:08,342 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2243 transitions. Word has length 26 [2021-11-03 05:29:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:08,343 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 2243 transitions. [2021-11-03 05:29:08,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2243 transitions. [2021-11-03 05:29:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:08,346 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:08,347 INFO L513 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] [2021-11-03 05:29:08,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:29:08,347 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1299544781, now seen corresponding path program 7 times [2021-11-03 05:29:08,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:08,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665807059] [2021-11-03 05:29:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:08,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:08,485 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:08,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665807059] [2021-11-03 05:29:08,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665807059] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:08,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:08,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:08,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986790390] [2021-11-03 05:29:08,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:08,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:08,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:08,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:08,487 INFO L87 Difference]: Start difference. First operand 824 states and 2243 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:08,717 INFO L93 Difference]: Finished difference Result 1146 states and 2980 transitions. [2021-11-03 05:29:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:29:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:08,728 INFO L225 Difference]: With dead ends: 1146 [2021-11-03 05:29:08,728 INFO L226 Difference]: Without dead ends: 1130 [2021-11-03 05:29:08,729 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:29:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-11-03 05:29:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 868. [2021-11-03 05:29:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 2.7058823529411766) internal successors, (2346), 867 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2346 transitions. [2021-11-03 05:29:08,767 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2346 transitions. Word has length 26 [2021-11-03 05:29:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:08,768 INFO L470 AbstractCegarLoop]: Abstraction has 868 states and 2346 transitions. [2021-11-03 05:29:08,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2346 transitions. [2021-11-03 05:29:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:08,771 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:08,772 INFO L513 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] [2021-11-03 05:29:08,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 05:29:08,772 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1661881157, now seen corresponding path program 8 times [2021-11-03 05:29:08,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:08,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141049364] [2021-11-03 05:29:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:08,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:08,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:08,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141049364] [2021-11-03 05:29:08,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141049364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:08,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:08,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:08,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240336859] [2021-11-03 05:29:08,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:08,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:08,934 INFO L87 Difference]: Start difference. First operand 868 states and 2346 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:09,183 INFO L93 Difference]: Finished difference Result 1248 states and 3160 transitions. [2021-11-03 05:29:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:29:09,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:09,193 INFO L225 Difference]: With dead ends: 1248 [2021-11-03 05:29:09,197 INFO L226 Difference]: Without dead ends: 1206 [2021-11-03 05:29:09,198 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:29:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2021-11-03 05:29:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 866. [2021-11-03 05:29:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 2.645086705202312) internal successors, (2288), 865 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2288 transitions. [2021-11-03 05:29:09,241 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 2288 transitions. Word has length 26 [2021-11-03 05:29:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:09,241 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 2288 transitions. [2021-11-03 05:29:09,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 2288 transitions. [2021-11-03 05:29:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:09,244 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:09,245 INFO L513 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] [2021-11-03 05:29:09,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:29:09,245 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1018497167, now seen corresponding path program 9 times [2021-11-03 05:29:09,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:09,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541803656] [2021-11-03 05:29:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:09,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:09,424 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:09,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541803656] [2021-11-03 05:29:09,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541803656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:09,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:09,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:09,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46676774] [2021-11-03 05:29:09,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:09,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:09,428 INFO L87 Difference]: Start difference. First operand 866 states and 2288 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:09,682 INFO L93 Difference]: Finished difference Result 1216 states and 2960 transitions. [2021-11-03 05:29:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:29:09,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:09,692 INFO L225 Difference]: With dead ends: 1216 [2021-11-03 05:29:09,692 INFO L226 Difference]: Without dead ends: 1130 [2021-11-03 05:29:09,693 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:29:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-11-03 05:29:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 800. [2021-11-03 05:29:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.599499374217772) internal successors, (2077), 799 states have internal predecessors, (2077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2077 transitions. [2021-11-03 05:29:09,729 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2077 transitions. Word has length 26 [2021-11-03 05:29:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:09,729 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 2077 transitions. [2021-11-03 05:29:09,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2077 transitions. [2021-11-03 05:29:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:09,733 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:09,733 INFO L513 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] [2021-11-03 05:29:09,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 05:29:09,734 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:09,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:09,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1247814497, now seen corresponding path program 10 times [2021-11-03 05:29:09,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:09,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496850201] [2021-11-03 05:29:09,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:09,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:09,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:09,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496850201] [2021-11-03 05:29:09,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496850201] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:09,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:09,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:09,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584272354] [2021-11-03 05:29:09,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:09,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:09,898 INFO L87 Difference]: Start difference. First operand 800 states and 2077 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:10,061 INFO L93 Difference]: Finished difference Result 1238 states and 3123 transitions. [2021-11-03 05:29:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:29:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:10,072 INFO L225 Difference]: With dead ends: 1238 [2021-11-03 05:29:10,076 INFO L226 Difference]: Without dead ends: 1230 [2021-11-03 05:29:10,076 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:29:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-11-03 05:29:10,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 796. [2021-11-03 05:29:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.6) internal successors, (2067), 795 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2067 transitions. [2021-11-03 05:29:10,113 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2067 transitions. Word has length 26 [2021-11-03 05:29:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:10,113 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 2067 transitions. [2021-11-03 05:29:10,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2067 transitions. [2021-11-03 05:29:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:10,116 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:10,117 INFO L513 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] [2021-11-03 05:29:10,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 05:29:10,117 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash 23293701, now seen corresponding path program 11 times [2021-11-03 05:29:10,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:10,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413931074] [2021-11-03 05:29:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:10,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:10,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:10,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413931074] [2021-11-03 05:29:10,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413931074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:10,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:10,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:10,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6489522] [2021-11-03 05:29:10,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:10,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:10,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:10,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:10,254 INFO L87 Difference]: Start difference. First operand 796 states and 2067 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:10,392 INFO L93 Difference]: Finished difference Result 804 states and 2075 transitions. [2021-11-03 05:29:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:10,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:10,399 INFO L225 Difference]: With dead ends: 804 [2021-11-03 05:29:10,399 INFO L226 Difference]: Without dead ends: 792 [2021-11-03 05:29:10,400 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-11-03 05:29:10,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2021-11-03 05:29:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 2.600505689001264) internal successors, (2057), 791 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2057 transitions. [2021-11-03 05:29:10,428 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2057 transitions. Word has length 26 [2021-11-03 05:29:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:10,430 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 2057 transitions. [2021-11-03 05:29:10,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2057 transitions. [2021-11-03 05:29:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:10,434 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:10,434 INFO L513 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] [2021-11-03 05:29:10,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 05:29:10,434 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash -980653901, now seen corresponding path program 12 times [2021-11-03 05:29:10,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:10,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793227529] [2021-11-03 05:29:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:10,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:10,589 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:10,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793227529] [2021-11-03 05:29:10,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793227529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:10,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:10,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:10,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254238115] [2021-11-03 05:29:10,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:10,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:10,591 INFO L87 Difference]: Start difference. First operand 792 states and 2057 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:10,704 INFO L93 Difference]: Finished difference Result 804 states and 2071 transitions. [2021-11-03 05:29:10,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:29:10,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:10,710 INFO L225 Difference]: With dead ends: 804 [2021-11-03 05:29:10,711 INFO L226 Difference]: Without dead ends: 788 [2021-11-03 05:29:10,711 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:29:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2021-11-03 05:29:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2021-11-03 05:29:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 2.6010165184243963) internal successors, (2047), 787 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2047 transitions. [2021-11-03 05:29:10,739 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 2047 transitions. Word has length 26 [2021-11-03 05:29:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:10,739 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 2047 transitions. [2021-11-03 05:29:10,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 2047 transitions. [2021-11-03 05:29:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:10,742 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:10,742 INFO L513 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] [2021-11-03 05:29:10,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 05:29:10,743 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -370014585, now seen corresponding path program 13 times [2021-11-03 05:29:10,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:10,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546510658] [2021-11-03 05:29:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:10,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:10,911 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:10,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546510658] [2021-11-03 05:29:10,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546510658] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:10,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:10,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:10,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257997266] [2021-11-03 05:29:10,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:10,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:10,913 INFO L87 Difference]: Start difference. First operand 788 states and 2047 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:11,056 INFO L93 Difference]: Finished difference Result 794 states and 2054 transitions. [2021-11-03 05:29:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:29:11,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:11,061 INFO L225 Difference]: With dead ends: 794 [2021-11-03 05:29:11,061 INFO L226 Difference]: Without dead ends: 788 [2021-11-03 05:29:11,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:29:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2021-11-03 05:29:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2021-11-03 05:29:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 2.5984752223634056) internal successors, (2045), 787 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2045 transitions. [2021-11-03 05:29:11,088 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 2045 transitions. Word has length 26 [2021-11-03 05:29:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:11,089 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 2045 transitions. [2021-11-03 05:29:11,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 2045 transitions. [2021-11-03 05:29:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:11,092 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:11,092 INFO L513 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] [2021-11-03 05:29:11,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 05:29:11,092 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash 51493947, now seen corresponding path program 14 times [2021-11-03 05:29:11,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:11,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502072715] [2021-11-03 05:29:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:11,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:11,208 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:11,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502072715] [2021-11-03 05:29:11,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502072715] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:11,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:11,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:11,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847627215] [2021-11-03 05:29:11,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:11,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:11,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:11,210 INFO L87 Difference]: Start difference. First operand 788 states and 2045 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:11,389 INFO L93 Difference]: Finished difference Result 1226 states and 3099 transitions. [2021-11-03 05:29:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:11,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:11,420 INFO L225 Difference]: With dead ends: 1226 [2021-11-03 05:29:11,420 INFO L226 Difference]: Without dead ends: 1210 [2021-11-03 05:29:11,420 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2021-11-03 05:29:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 776. [2021-11-03 05:29:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 2.606451612903226) internal successors, (2020), 775 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 2020 transitions. [2021-11-03 05:29:11,451 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 2020 transitions. Word has length 26 [2021-11-03 05:29:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:11,451 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 2020 transitions. [2021-11-03 05:29:11,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 2020 transitions. [2021-11-03 05:29:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:11,454 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:11,454 INFO L513 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] [2021-11-03 05:29:11,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 05:29:11,455 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1704422533, now seen corresponding path program 15 times [2021-11-03 05:29:11,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:11,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472145911] [2021-11-03 05:29:11,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:11,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:11,555 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:11,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472145911] [2021-11-03 05:29:11,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472145911] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:11,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:11,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:11,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74912907] [2021-11-03 05:29:11,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:11,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:11,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:11,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:11,558 INFO L87 Difference]: Start difference. First operand 776 states and 2020 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:11,647 INFO L93 Difference]: Finished difference Result 776 states and 2018 transitions. [2021-11-03 05:29:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:11,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:11,654 INFO L225 Difference]: With dead ends: 776 [2021-11-03 05:29:11,654 INFO L226 Difference]: Without dead ends: 760 [2021-11-03 05:29:11,654 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2021-11-03 05:29:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2021-11-03 05:29:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 2.624505928853755) internal successors, (1992), 759 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1992 transitions. [2021-11-03 05:29:11,680 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1992 transitions. Word has length 26 [2021-11-03 05:29:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:11,681 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1992 transitions. [2021-11-03 05:29:11,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1992 transitions. [2021-11-03 05:29:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:11,684 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:11,684 INFO L513 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] [2021-11-03 05:29:11,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 05:29:11,685 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash -55865915, now seen corresponding path program 16 times [2021-11-03 05:29:11,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:11,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269898036] [2021-11-03 05:29:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:11,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:11,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:11,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269898036] [2021-11-03 05:29:11,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269898036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:11,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:11,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:11,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502074873] [2021-11-03 05:29:11,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:11,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:11,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:11,804 INFO L87 Difference]: Start difference. First operand 760 states and 1992 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:11,915 INFO L93 Difference]: Finished difference Result 766 states and 1999 transitions. [2021-11-03 05:29:11,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:11,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:11,922 INFO L225 Difference]: With dead ends: 766 [2021-11-03 05:29:11,922 INFO L226 Difference]: Without dead ends: 760 [2021-11-03 05:29:11,922 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2021-11-03 05:29:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2021-11-03 05:29:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 2.6218708827404478) internal successors, (1990), 759 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1990 transitions. [2021-11-03 05:29:11,947 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1990 transitions. Word has length 26 [2021-11-03 05:29:11,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:11,948 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1990 transitions. [2021-11-03 05:29:11,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1990 transitions. [2021-11-03 05:29:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:11,950 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:11,951 INFO L513 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] [2021-11-03 05:29:11,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 05:29:11,951 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash 374512411, now seen corresponding path program 17 times [2021-11-03 05:29:11,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:11,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230810486] [2021-11-03 05:29:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:11,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:12,062 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:12,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230810486] [2021-11-03 05:29:12,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230810486] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:12,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:12,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:12,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97481198] [2021-11-03 05:29:12,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:12,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:12,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:12,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:12,064 INFO L87 Difference]: Start difference. First operand 760 states and 1990 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:12,214 INFO L93 Difference]: Finished difference Result 1194 states and 3038 transitions. [2021-11-03 05:29:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:29:12,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:12,223 INFO L225 Difference]: With dead ends: 1194 [2021-11-03 05:29:12,223 INFO L226 Difference]: Without dead ends: 1184 [2021-11-03 05:29:12,224 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:29:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2021-11-03 05:29:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 754. [2021-11-03 05:29:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 2.6254980079681274) internal successors, (1977), 753 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1977 transitions. [2021-11-03 05:29:12,254 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1977 transitions. Word has length 26 [2021-11-03 05:29:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:12,254 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1977 transitions. [2021-11-03 05:29:12,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1977 transitions. [2021-11-03 05:29:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:12,257 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:12,257 INFO L513 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] [2021-11-03 05:29:12,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 05:29:12,257 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:12,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1003462385, now seen corresponding path program 18 times [2021-11-03 05:29:12,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:12,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472342963] [2021-11-03 05:29:12,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:12,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:12,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:12,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472342963] [2021-11-03 05:29:12,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472342963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:12,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:12,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:12,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837103245] [2021-11-03 05:29:12,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:12,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:12,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:12,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:12,385 INFO L87 Difference]: Start difference. First operand 754 states and 1977 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:12,470 INFO L93 Difference]: Finished difference Result 754 states and 1975 transitions. [2021-11-03 05:29:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:29:12,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:12,474 INFO L225 Difference]: With dead ends: 754 [2021-11-03 05:29:12,475 INFO L226 Difference]: Without dead ends: 736 [2021-11-03 05:29:12,475 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:29:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-11-03 05:29:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2021-11-03 05:29:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.6476190476190475) internal successors, (1946), 735 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1946 transitions. [2021-11-03 05:29:12,499 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1946 transitions. Word has length 26 [2021-11-03 05:29:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:12,499 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 1946 transitions. [2021-11-03 05:29:12,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1946 transitions. [2021-11-03 05:29:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:12,502 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:12,502 INFO L513 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] [2021-11-03 05:29:12,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 05:29:12,502 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1070492527, now seen corresponding path program 19 times [2021-11-03 05:29:12,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:12,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839779246] [2021-11-03 05:29:12,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:12,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:12,564 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:12,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839779246] [2021-11-03 05:29:12,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839779246] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:12,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:12,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:29:12,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779596872] [2021-11-03 05:29:12,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:29:12,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:12,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:29:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:29:12,566 INFO L87 Difference]: Start difference. First operand 736 states and 1946 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:12,651 INFO L93 Difference]: Finished difference Result 626 states and 1594 transitions. [2021-11-03 05:29:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:29:12,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:12,654 INFO L225 Difference]: With dead ends: 626 [2021-11-03 05:29:12,654 INFO L226 Difference]: Without dead ends: 626 [2021-11-03 05:29:12,655 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:29:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-11-03 05:29:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2021-11-03 05:29:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 2.5504) internal successors, (1594), 625 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1594 transitions. [2021-11-03 05:29:12,675 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1594 transitions. Word has length 26 [2021-11-03 05:29:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:12,676 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 1594 transitions. [2021-11-03 05:29:12,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1594 transitions. [2021-11-03 05:29:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:12,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:12,678 INFO L513 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] [2021-11-03 05:29:12,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 05:29:12,679 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash -437936799, now seen corresponding path program 20 times [2021-11-03 05:29:12,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:12,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143606551] [2021-11-03 05:29:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:12,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:12,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:12,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143606551] [2021-11-03 05:29:12,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143606551] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:12,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:12,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:29:12,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961168682] [2021-11-03 05:29:12,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:29:12,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:12,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:29:12,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:29:12,792 INFO L87 Difference]: Start difference. First operand 626 states and 1594 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:12,841 INFO L93 Difference]: Finished difference Result 687 states and 1703 transitions. [2021-11-03 05:29:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:29:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:12,843 INFO L225 Difference]: With dead ends: 687 [2021-11-03 05:29:12,843 INFO L226 Difference]: Without dead ends: 266 [2021-11-03 05:29:12,843 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:29:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-03 05:29:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-11-03 05:29:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.1622641509433964) internal successors, (573), 265 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 573 transitions. [2021-11-03 05:29:12,852 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 573 transitions. Word has length 26 [2021-11-03 05:29:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:12,852 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 573 transitions. [2021-11-03 05:29:12,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 573 transitions. [2021-11-03 05:29:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:12,853 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:12,853 INFO L513 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] [2021-11-03 05:29:12,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-03 05:29:12,854 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1189257551, now seen corresponding path program 21 times [2021-11-03 05:29:12,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:12,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724243456] [2021-11-03 05:29:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:12,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:12,977 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:12,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724243456] [2021-11-03 05:29:12,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724243456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:12,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:12,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:12,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169672247] [2021-11-03 05:29:12,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:12,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:12,979 INFO L87 Difference]: Start difference. First operand 266 states and 573 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:13,143 INFO L93 Difference]: Finished difference Result 416 states and 872 transitions. [2021-11-03 05:29:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:13,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:13,146 INFO L225 Difference]: With dead ends: 416 [2021-11-03 05:29:13,146 INFO L226 Difference]: Without dead ends: 408 [2021-11-03 05:29:13,146 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-11-03 05:29:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 264. [2021-11-03 05:29:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.1444866920152093) internal successors, (564), 263 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 564 transitions. [2021-11-03 05:29:13,157 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 564 transitions. Word has length 26 [2021-11-03 05:29:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:13,159 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 564 transitions. [2021-11-03 05:29:13,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 564 transitions. [2021-11-03 05:29:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:13,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:13,161 INFO L513 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] [2021-11-03 05:29:13,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-03 05:29:13,161 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2100688019, now seen corresponding path program 22 times [2021-11-03 05:29:13,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:13,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881794432] [2021-11-03 05:29:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:13,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:13,276 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:13,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881794432] [2021-11-03 05:29:13,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881794432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:13,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:13,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:13,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107746889] [2021-11-03 05:29:13,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:13,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:13,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:13,278 INFO L87 Difference]: Start difference. First operand 264 states and 564 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:13,432 INFO L93 Difference]: Finished difference Result 284 states and 600 transitions. [2021-11-03 05:29:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:29:13,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:13,434 INFO L225 Difference]: With dead ends: 284 [2021-11-03 05:29:13,434 INFO L226 Difference]: Without dead ends: 272 [2021-11-03 05:29:13,434 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:29:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-03 05:29:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2021-11-03 05:29:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.138996138996139) internal successors, (554), 259 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 554 transitions. [2021-11-03 05:29:13,444 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 554 transitions. Word has length 26 [2021-11-03 05:29:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:13,444 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 554 transitions. [2021-11-03 05:29:13,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 554 transitions. [2021-11-03 05:29:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:13,446 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:13,446 INFO L513 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] [2021-11-03 05:29:13,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-03 05:29:13,446 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:13,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1351039545, now seen corresponding path program 23 times [2021-11-03 05:29:13,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:13,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756272696] [2021-11-03 05:29:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:13,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:13,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:13,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756272696] [2021-11-03 05:29:13,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756272696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:13,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:13,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:13,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86596679] [2021-11-03 05:29:13,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:13,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:13,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:13,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:13,585 INFO L87 Difference]: Start difference. First operand 260 states and 554 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:13,720 INFO L93 Difference]: Finished difference Result 276 states and 580 transitions. [2021-11-03 05:29:13,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:29:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:13,721 INFO L225 Difference]: With dead ends: 276 [2021-11-03 05:29:13,722 INFO L226 Difference]: Without dead ends: 260 [2021-11-03 05:29:13,722 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:29:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-03 05:29:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 256. [2021-11-03 05:29:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.1333333333333333) internal successors, (544), 255 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 544 transitions. [2021-11-03 05:29:13,730 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 544 transitions. Word has length 26 [2021-11-03 05:29:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:13,730 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 544 transitions. [2021-11-03 05:29:13,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 544 transitions. [2021-11-03 05:29:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:13,732 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:13,732 INFO L513 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] [2021-11-03 05:29:13,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-03 05:29:13,732 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1334036889, now seen corresponding path program 24 times [2021-11-03 05:29:13,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:13,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757160747] [2021-11-03 05:29:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:13,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:13,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:13,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757160747] [2021-11-03 05:29:13,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757160747] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:13,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:13,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:13,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856077518] [2021-11-03 05:29:13,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:13,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:13,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:13,867 INFO L87 Difference]: Start difference. First operand 256 states and 544 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:13,988 INFO L93 Difference]: Finished difference Result 278 states and 581 transitions. [2021-11-03 05:29:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:29:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:13,990 INFO L225 Difference]: With dead ends: 278 [2021-11-03 05:29:13,990 INFO L226 Difference]: Without dead ends: 270 [2021-11-03 05:29:13,990 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:29:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-03 05:29:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 256. [2021-11-03 05:29:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.1254901960784314) internal successors, (542), 255 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 542 transitions. [2021-11-03 05:29:13,997 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 542 transitions. Word has length 26 [2021-11-03 05:29:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:13,998 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 542 transitions. [2021-11-03 05:29:13,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 542 transitions. [2021-11-03 05:29:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:13,999 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:14,000 INFO L513 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] [2021-11-03 05:29:14,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-03 05:29:14,000 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1370542237, now seen corresponding path program 25 times [2021-11-03 05:29:14,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:14,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474566203] [2021-11-03 05:29:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:14,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:14,124 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:14,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474566203] [2021-11-03 05:29:14,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474566203] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:14,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:14,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:14,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567265181] [2021-11-03 05:29:14,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:14,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:14,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:14,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:14,126 INFO L87 Difference]: Start difference. First operand 256 states and 542 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:14,285 INFO L93 Difference]: Finished difference Result 402 states and 833 transitions. [2021-11-03 05:29:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:14,287 INFO L225 Difference]: With dead ends: 402 [2021-11-03 05:29:14,287 INFO L226 Difference]: Without dead ends: 390 [2021-11-03 05:29:14,287 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-03 05:29:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 244. [2021-11-03 05:29:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.102880658436214) internal successors, (511), 243 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 511 transitions. [2021-11-03 05:29:14,296 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 511 transitions. Word has length 26 [2021-11-03 05:29:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:14,297 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 511 transitions. [2021-11-03 05:29:14,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 511 transitions. [2021-11-03 05:29:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:14,298 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:14,298 INFO L513 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] [2021-11-03 05:29:14,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-03 05:29:14,299 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash 320377861, now seen corresponding path program 26 times [2021-11-03 05:29:14,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:14,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939172421] [2021-11-03 05:29:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:14,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:14,423 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:14,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939172421] [2021-11-03 05:29:14,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939172421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:14,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:14,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:14,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529794734] [2021-11-03 05:29:14,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:14,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:14,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:14,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:14,426 INFO L87 Difference]: Start difference. First operand 244 states and 511 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:14,582 INFO L93 Difference]: Finished difference Result 270 states and 558 transitions. [2021-11-03 05:29:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:29:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:14,583 INFO L225 Difference]: With dead ends: 270 [2021-11-03 05:29:14,583 INFO L226 Difference]: Without dead ends: 252 [2021-11-03 05:29:14,584 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:29:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-11-03 05:29:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 222. [2021-11-03 05:29:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.1131221719457014) internal successors, (467), 221 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 467 transitions. [2021-11-03 05:29:14,591 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 467 transitions. Word has length 26 [2021-11-03 05:29:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:14,591 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 467 transitions. [2021-11-03 05:29:14,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 467 transitions. [2021-11-03 05:29:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:14,592 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:14,592 INFO L513 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] [2021-11-03 05:29:14,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-03 05:29:14,593 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash 112868405, now seen corresponding path program 27 times [2021-11-03 05:29:14,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:14,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723598893] [2021-11-03 05:29:14,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:14,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:14,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:14,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723598893] [2021-11-03 05:29:14,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723598893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:14,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:14,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:29:14,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192231444] [2021-11-03 05:29:14,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:29:14,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:14,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:29:14,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:29:14,668 INFO L87 Difference]: Start difference. First operand 222 states and 467 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:14,764 INFO L93 Difference]: Finished difference Result 368 states and 738 transitions. [2021-11-03 05:29:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:29:14,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:14,766 INFO L225 Difference]: With dead ends: 368 [2021-11-03 05:29:14,766 INFO L226 Difference]: Without dead ends: 310 [2021-11-03 05:29:14,766 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-03 05:29:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 234. [2021-11-03 05:29:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.03862660944206) internal successors, (475), 233 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 475 transitions. [2021-11-03 05:29:14,774 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 475 transitions. Word has length 26 [2021-11-03 05:29:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:14,775 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 475 transitions. [2021-11-03 05:29:14,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 475 transitions. [2021-11-03 05:29:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:14,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:14,776 INFO L513 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] [2021-11-03 05:29:14,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-03 05:29:14,777 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash 212938651, now seen corresponding path program 28 times [2021-11-03 05:29:14,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:14,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142601850] [2021-11-03 05:29:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:14,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:14,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:14,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142601850] [2021-11-03 05:29:14,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142601850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:14,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:14,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:14,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549427114] [2021-11-03 05:29:14,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:14,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:14,896 INFO L87 Difference]: Start difference. First operand 234 states and 475 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:15,076 INFO L93 Difference]: Finished difference Result 232 states and 418 transitions. [2021-11-03 05:29:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:29:15,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:15,077 INFO L225 Difference]: With dead ends: 232 [2021-11-03 05:29:15,077 INFO L226 Difference]: Without dead ends: 102 [2021-11-03 05:29:15,077 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:29:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-03 05:29:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2021-11-03 05:29:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.7882352941176471) internal successors, (152), 85 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2021-11-03 05:29:15,081 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 26 [2021-11-03 05:29:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:15,081 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2021-11-03 05:29:15,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2021-11-03 05:29:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:15,082 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:15,082 INFO L513 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] [2021-11-03 05:29:15,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-03 05:29:15,082 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:15,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:15,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1655944221, now seen corresponding path program 29 times [2021-11-03 05:29:15,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:15,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119070737] [2021-11-03 05:29:15,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:15,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:15,209 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:15,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119070737] [2021-11-03 05:29:15,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119070737] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:15,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:15,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:15,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817325827] [2021-11-03 05:29:15,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:15,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:15,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:15,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:15,212 INFO L87 Difference]: Start difference. First operand 86 states and 152 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:15,267 INFO L93 Difference]: Finished difference Result 92 states and 159 transitions. [2021-11-03 05:29:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:29:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:15,268 INFO L225 Difference]: With dead ends: 92 [2021-11-03 05:29:15,268 INFO L226 Difference]: Without dead ends: 84 [2021-11-03 05:29:15,269 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:29:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-03 05:29:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-11-03 05:29:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.7710843373493976) internal successors, (147), 83 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 147 transitions. [2021-11-03 05:29:15,271 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 147 transitions. Word has length 26 [2021-11-03 05:29:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:15,272 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 147 transitions. [2021-11-03 05:29:15,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 147 transitions. [2021-11-03 05:29:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:15,272 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:15,273 INFO L513 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] [2021-11-03 05:29:15,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-03 05:29:15,273 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:15,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash -920503369, now seen corresponding path program 30 times [2021-11-03 05:29:15,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:15,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98736064] [2021-11-03 05:29:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:15,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:15,390 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:15,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98736064] [2021-11-03 05:29:15,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98736064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:15,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:15,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:15,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889215059] [2021-11-03 05:29:15,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:15,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:15,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:15,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:15,392 INFO L87 Difference]: Start difference. First operand 84 states and 147 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:15,455 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2021-11-03 05:29:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:29:15,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:15,456 INFO L225 Difference]: With dead ends: 88 [2021-11-03 05:29:15,457 INFO L226 Difference]: Without dead ends: 82 [2021-11-03 05:29:15,457 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:29:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-03 05:29:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-11-03 05:29:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.7530864197530864) internal successors, (142), 81 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 142 transitions. [2021-11-03 05:29:15,460 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 142 transitions. Word has length 26 [2021-11-03 05:29:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:15,460 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 142 transitions. [2021-11-03 05:29:15,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 142 transitions. [2021-11-03 05:29:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:15,461 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:15,461 INFO L513 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] [2021-11-03 05:29:15,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-03 05:29:15,462 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash -58769523, now seen corresponding path program 31 times [2021-11-03 05:29:15,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:15,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335956361] [2021-11-03 05:29:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:15,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:15,585 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:15,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335956361] [2021-11-03 05:29:15,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335956361] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:15,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:15,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:15,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828979815] [2021-11-03 05:29:15,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:15,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:15,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:15,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:15,589 INFO L87 Difference]: Start difference. First operand 82 states and 142 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:15,674 INFO L93 Difference]: Finished difference Result 104 states and 175 transitions. [2021-11-03 05:29:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:29:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:15,675 INFO L225 Difference]: With dead ends: 104 [2021-11-03 05:29:15,675 INFO L226 Difference]: Without dead ends: 86 [2021-11-03 05:29:15,675 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:29:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-11-03 05:29:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2021-11-03 05:29:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 71 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 124 transitions. [2021-11-03 05:29:15,678 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 124 transitions. Word has length 26 [2021-11-03 05:29:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:15,678 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 124 transitions. [2021-11-03 05:29:15,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 124 transitions. [2021-11-03 05:29:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:15,679 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:15,679 INFO L513 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] [2021-11-03 05:29:15,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-03 05:29:15,679 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:15,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1548704625, now seen corresponding path program 32 times [2021-11-03 05:29:15,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:15,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001342094] [2021-11-03 05:29:15,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:15,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:15,821 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:15,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001342094] [2021-11-03 05:29:15,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001342094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:15,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:15,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:15,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496242984] [2021-11-03 05:29:15,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:15,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:15,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:15,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:15,824 INFO L87 Difference]: Start difference. First operand 72 states and 124 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:15,926 INFO L93 Difference]: Finished difference Result 90 states and 147 transitions. [2021-11-03 05:29:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:29:15,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:15,928 INFO L225 Difference]: With dead ends: 90 [2021-11-03 05:29:15,928 INFO L226 Difference]: Without dead ends: 82 [2021-11-03 05:29:15,928 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:29:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-11-03 05:29:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2021-11-03 05:29:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 114 transitions. [2021-11-03 05:29:15,931 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 114 transitions. Word has length 26 [2021-11-03 05:29:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:15,931 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 114 transitions. [2021-11-03 05:29:15,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 114 transitions. [2021-11-03 05:29:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:15,932 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:15,932 INFO L513 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] [2021-11-03 05:29:15,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-03 05:29:15,933 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:15,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash 637274157, now seen corresponding path program 33 times [2021-11-03 05:29:15,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:15,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356495172] [2021-11-03 05:29:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:15,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:16,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:16,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356495172] [2021-11-03 05:29:16,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356495172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:16,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:16,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:16,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932300312] [2021-11-03 05:29:16,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:16,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:16,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:16,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:16,051 INFO L87 Difference]: Start difference. First operand 68 states and 114 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:16,134 INFO L93 Difference]: Finished difference Result 76 states and 122 transitions. [2021-11-03 05:29:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:16,135 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:16,135 INFO L225 Difference]: With dead ends: 76 [2021-11-03 05:29:16,135 INFO L226 Difference]: Without dead ends: 64 [2021-11-03 05:29:16,136 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:16,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-03 05:29:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-03 05:29:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 63 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2021-11-03 05:29:16,138 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 26 [2021-11-03 05:29:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:16,138 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2021-11-03 05:29:16,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2021-11-03 05:29:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:16,139 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:16,139 INFO L513 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] [2021-11-03 05:29:16,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-03 05:29:16,139 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1599078249, now seen corresponding path program 34 times [2021-11-03 05:29:16,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:16,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653372730] [2021-11-03 05:29:16,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:16,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:16,237 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:16,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653372730] [2021-11-03 05:29:16,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653372730] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:16,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:16,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:16,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026407923] [2021-11-03 05:29:16,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:16,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:16,239 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:16,321 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2021-11-03 05:29:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 05:29:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:16,322 INFO L225 Difference]: With dead ends: 76 [2021-11-03 05:29:16,322 INFO L226 Difference]: Without dead ends: 60 [2021-11-03 05:29:16,323 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-03 05:29:16,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-03 05:29:16,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-03 05:29:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 59 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 94 transitions. [2021-11-03 05:29:16,325 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 94 transitions. Word has length 26 [2021-11-03 05:29:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:16,325 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 94 transitions. [2021-11-03 05:29:16,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 94 transitions. [2021-11-03 05:29:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:16,326 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:16,326 INFO L513 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] [2021-11-03 05:29:16,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-03 05:29:16,326 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:16,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1198446383, now seen corresponding path program 35 times [2021-11-03 05:29:16,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:16,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100188768] [2021-11-03 05:29:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:16,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:16,450 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:16,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100188768] [2021-11-03 05:29:16,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100188768] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:16,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:16,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:16,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838179363] [2021-11-03 05:29:16,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:16,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:16,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:16,451 INFO L87 Difference]: Start difference. First operand 60 states and 94 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:16,543 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2021-11-03 05:29:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:16,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:16,544 INFO L225 Difference]: With dead ends: 66 [2021-11-03 05:29:16,544 INFO L226 Difference]: Without dead ends: 58 [2021-11-03 05:29:16,544 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-03 05:29:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-11-03 05:29:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 57 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 89 transitions. [2021-11-03 05:29:16,546 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 89 transitions. Word has length 26 [2021-11-03 05:29:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:16,546 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 89 transitions. [2021-11-03 05:29:16,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 89 transitions. [2021-11-03 05:29:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:16,547 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:16,547 INFO L513 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] [2021-11-03 05:29:16,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-03 05:29:16,547 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1735100747, now seen corresponding path program 36 times [2021-11-03 05:29:16,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:16,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976792186] [2021-11-03 05:29:16,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:16,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:16,670 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:16,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976792186] [2021-11-03 05:29:16,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976792186] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:16,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:16,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:16,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390327419] [2021-11-03 05:29:16,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:16,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:16,672 INFO L87 Difference]: Start difference. First operand 58 states and 89 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:16,770 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2021-11-03 05:29:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:16,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:16,772 INFO L225 Difference]: With dead ends: 68 [2021-11-03 05:29:16,772 INFO L226 Difference]: Without dead ends: 60 [2021-11-03 05:29:16,772 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-03 05:29:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2021-11-03 05:29:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2021-11-03 05:29:16,774 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 26 [2021-11-03 05:29:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:16,775 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2021-11-03 05:29:16,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2021-11-03 05:29:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:16,775 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:16,776 INFO L513 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] [2021-11-03 05:29:16,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-03 05:29:16,776 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1300301971, now seen corresponding path program 37 times [2021-11-03 05:29:16,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:16,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424811019] [2021-11-03 05:29:16,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:16,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:16,906 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:16,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424811019] [2021-11-03 05:29:16,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424811019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:16,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:16,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:16,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225853252] [2021-11-03 05:29:16,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:16,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:16,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:16,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:16,910 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:16,998 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2021-11-03 05:29:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-03 05:29:16,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:16,999 INFO L225 Difference]: With dead ends: 54 [2021-11-03 05:29:16,999 INFO L226 Difference]: Without dead ends: 42 [2021-11-03 05:29:16,999 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:29:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-03 05:29:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-11-03 05:29:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2021-11-03 05:29:17,001 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 26 [2021-11-03 05:29:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:17,002 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2021-11-03 05:29:17,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2021-11-03 05:29:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:17,003 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:17,003 INFO L513 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] [2021-11-03 05:29:17,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-03 05:29:17,004 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:17,004 INFO L85 PathProgramCache]: Analyzing trace with hash -459388049, now seen corresponding path program 38 times [2021-11-03 05:29:17,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:17,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765906339] [2021-11-03 05:29:17,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:17,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:17,137 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:17,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765906339] [2021-11-03 05:29:17,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765906339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:17,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:17,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:17,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039671144] [2021-11-03 05:29:17,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:17,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:17,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:17,142 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:17,191 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2021-11-03 05:29:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:29:17,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:17,192 INFO L225 Difference]: With dead ends: 48 [2021-11-03 05:29:17,192 INFO L226 Difference]: Without dead ends: 40 [2021-11-03 05:29:17,193 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:29:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-03 05:29:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-11-03 05:29:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2021-11-03 05:29:17,194 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 26 [2021-11-03 05:29:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:17,195 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2021-11-03 05:29:17,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2021-11-03 05:29:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:17,196 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:17,196 INFO L513 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] [2021-11-03 05:29:17,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-03 05:29:17,196 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash 63897185, now seen corresponding path program 39 times [2021-11-03 05:29:17,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:17,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949181879] [2021-11-03 05:29:17,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:17,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:17,310 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:17,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949181879] [2021-11-03 05:29:17,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949181879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:17,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:17,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:17,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972136107] [2021-11-03 05:29:17,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:17,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:17,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:17,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:17,313 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:17,365 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2021-11-03 05:29:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:29:17,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:17,366 INFO L225 Difference]: With dead ends: 44 [2021-11-03 05:29:17,367 INFO L226 Difference]: Without dead ends: 38 [2021-11-03 05:29:17,367 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:29:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-03 05:29:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-03 05:29:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2021-11-03 05:29:17,368 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 26 [2021-11-03 05:29:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:17,369 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2021-11-03 05:29:17,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2021-11-03 05:29:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:29:17,369 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:29:17,369 INFO L513 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] [2021-11-03 05:29:17,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-03 05:29:17,370 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-11-03 05:29:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:29:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1348116757, now seen corresponding path program 40 times [2021-11-03 05:29:17,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:29:17,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643651327] [2021-11-03 05:29:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:29:17,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:29:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:29:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:29:17,468 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:29:17,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643651327] [2021-11-03 05:29:17,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643651327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:29:17,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:29:17,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 05:29:17,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105990713] [2021-11-03 05:29:17,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 05:29:17,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:29:17,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 05:29:17,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:29:17,470 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:29:17,512 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2021-11-03 05:29:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:29:17,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-03 05:29:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:29:17,513 INFO L225 Difference]: With dead ends: 26 [2021-11-03 05:29:17,513 INFO L226 Difference]: Without dead ends: 0 [2021-11-03 05:29:17,513 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:29:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-03 05:29:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-03 05:29:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-03 05:29:17,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-11-03 05:29:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:29:17,514 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-03 05:29:17,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:29:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-03 05:29:17,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-03 05:29:17,517 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:29:17,517 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-03 05:29:17,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-03 05:29:17,519 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-11-03 05:29:17,519 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATION [2021-11-03 05:29:17,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-03 05:29:17,521 INFO L731 BasicCegarLoop]: Path program histogram: [40] [2021-11-03 05:29:17,523 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-03 05:29:17,523 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:29:17,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:29:17 BasicIcfg [2021-11-03 05:29:17,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:29:17,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:29:17,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:29:17,526 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:29:17,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:28:58" (3/4) ... [2021-11-03 05:29:17,529 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-03 05:29:17,533 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-11-03 05:29:17,534 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-11-03 05:29:17,534 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-11-03 05:29:17,534 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2021-11-03 05:29:17,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-11-03 05:29:17,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-03 05:29:17,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 05:29:17,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 05:29:17,586 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 05:29:17,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:29:17,588 INFO L168 Benchmark]: Toolchain (without parser) took 20072.28 ms. Allocated memory was 96.5 MB in the beginning and 257.9 MB in the end (delta: 161.5 MB). Free memory was 62.8 MB in the beginning and 129.7 MB in the end (delta: -66.8 MB). Peak memory consumption was 95.2 MB. Max. memory is 16.1 GB. [2021-11-03 05:29:17,588 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 96.5 MB. Free memory is still 49.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:29:17,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.60 ms. Allocated memory was 96.5 MB in the beginning and 136.3 MB in the end (delta: 39.8 MB). Free memory was 62.6 MB in the beginning and 109.4 MB in the end (delta: -46.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 05:29:17,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 136.3 MB. Free memory was 109.4 MB in the beginning and 107.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:29:17,589 INFO L168 Benchmark]: Boogie Preprocessor took 51.22 ms. Allocated memory is still 136.3 MB. Free memory was 107.3 MB in the beginning and 105.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:29:17,590 INFO L168 Benchmark]: RCFGBuilder took 691.79 ms. Allocated memory is still 136.3 MB. Free memory was 105.8 MB in the beginning and 86.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-03 05:29:17,590 INFO L168 Benchmark]: TraceAbstraction took 18824.01 ms. Allocated memory was 136.3 MB in the beginning and 257.9 MB in the end (delta: 121.6 MB). Free memory was 85.5 MB in the beginning and 133.9 MB in the end (delta: -48.4 MB). Peak memory consumption was 74.9 MB. Max. memory is 16.1 GB. [2021-11-03 05:29:17,591 INFO L168 Benchmark]: Witness Printer took 60.40 ms. Allocated memory is still 257.9 MB. Free memory was 133.9 MB in the beginning and 129.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-03 05:29:17,596 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 96.5 MB. Free memory is still 49.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 375.60 ms. Allocated memory was 96.5 MB in the beginning and 136.3 MB in the end (delta: 39.8 MB). Free memory was 62.6 MB in the beginning and 109.4 MB in the end (delta: -46.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 136.3 MB. Free memory was 109.4 MB in the beginning and 107.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.22 ms. Allocated memory is still 136.3 MB. Free memory was 107.3 MB in the beginning and 105.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 691.79 ms. Allocated memory is still 136.3 MB. Free memory was 105.8 MB in the beginning and 86.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18824.01 ms. Allocated memory was 136.3 MB in the beginning and 257.9 MB in the end (delta: 121.6 MB). Free memory was 85.5 MB in the beginning and 133.9 MB in the end (delta: -48.4 MB). Peak memory consumption was 74.9 MB. Max. memory is 16.1 GB. * Witness Printer took 60.40 ms. Allocated memory is still 257.9 MB. Free memory was 133.9 MB in the beginning and 129.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 145 PlacesBefore, 44 PlacesAfterwards, 134 TransitionsBefore, 31 TransitionsAfterwards, 1302 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 3127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1872, positive: 1768, positive conditional: 0, positive unconditional: 1768, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 946, positive: 912, positive conditional: 0, positive unconditional: 912, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 946, positive: 878, positive conditional: 0, positive unconditional: 878, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 184, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1872, positive: 856, positive conditional: 0, positive unconditional: 856, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 946, unknown conditional: 0, unknown unconditional: 946] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 146]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 40, TraceHistogramMax: 1, PathProgramHistogramMax: 40, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1350 SDtfs, 1274 SDslu, 4651 SDs, 0 SdLazy, 4401 SolverSat, 856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=7, InterpolantAutomatonStates: 409, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 4290 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 5996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-03 05:29:17,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646dafc2-47e3-4b1b-8538-86a092bacd7a/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE