./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur --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 57b20b3268fa30a07af1365aac59c96531ad2ebea6861c18a1d5dfea8339adbb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 01:00:15,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:00:15,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:00:15,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:00:15,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:00:15,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:00:15,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:00:15,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:00:15,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:00:15,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:00:15,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:00:15,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:00:15,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:00:15,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:00:15,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:00:15,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:00:15,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:00:15,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:00:15,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:00:15,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:00:15,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:00:15,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:00:16,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:00:16,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:00:16,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:00:16,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:00:16,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:00:16,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:00:16,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:00:16,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:00:16,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:00:16,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:00:16,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:00:16,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:00:16,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:00:16,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:00:16,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:00:16,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:00:16,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:00:16,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:00:16,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:00:16,035 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 01:00:16,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:00:16,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:00:16,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:00:16,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:00:16,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:00:16,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:00:16,079 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:00:16,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:00:16,080 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:00:16,080 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:00:16,081 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:00:16,081 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:00:16,082 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:00:16,082 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:00:16,082 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:00:16,082 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:00:16,083 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:00:16,083 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:00:16,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:00:16,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:00:16,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:00:16,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:00:16,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:00:16,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:00:16,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:00:16,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:00:16,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:00:16,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:00:16,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:00:16,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:00:16,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:00:16,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:00:16,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:00:16,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:00:16,089 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:00:16,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:00:16,090 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:00:16,090 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:00:16,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:00:16,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:00:16,091 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:00:16,091 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/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_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur 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 -> 57b20b3268fa30a07af1365aac59c96531ad2ebea6861c18a1d5dfea8339adbb [2022-11-26 01:00:16,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:00:16,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:00:16,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:00:16,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:00:16,529 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:00:16,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2022-11-26 01:00:19,603 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:00:19,864 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:00:19,865 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2022-11-26 01:00:19,873 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/data/87d9f4b3b/7b740d96706f47c1bb5d75c2b99a5a3d/FLAG60c08d428 [2022-11-26 01:00:19,889 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/data/87d9f4b3b/7b740d96706f47c1bb5d75c2b99a5a3d [2022-11-26 01:00:19,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:00:19,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:00:19,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:00:19,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:00:19,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:00:19,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:00:19" (1/1) ... [2022-11-26 01:00:19,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ccc80fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:19, skipping insertion in model container [2022-11-26 01:00:19,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:00:19" (1/1) ... [2022-11-26 01:00:19,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:00:19,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:00:20,251 WARN L237 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_8297c48e-1f40-4cf8-aca2-71f00303206c/sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c[6501,6514] [2022-11-26 01:00:20,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:00:20,271 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:00:20,319 WARN L237 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_8297c48e-1f40-4cf8-aca2-71f00303206c/sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c[6501,6514] [2022-11-26 01:00:20,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:00:20,340 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:00:20,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20 WrapperNode [2022-11-26 01:00:20,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:00:20,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:00:20,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:00:20,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:00:20,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,413 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 574 [2022-11-26 01:00:20,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:00:20,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:00:20,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:00:20,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:00:20,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,458 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:00:20,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:00:20,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:00:20,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:00:20,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (1/1) ... [2022-11-26 01:00:20,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:00:20,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:00:20,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:00:20,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:00:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:00:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 01:00:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 01:00:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 01:00:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-26 01:00:20,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-26 01:00:20,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-26 01:00:20,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-26 01:00:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-26 01:00:20,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-26 01:00:20,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:00:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 01:00:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:00:20,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:00:20,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:00:20,584 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 01:00:20,853 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:00:20,855 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:00:21,847 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:00:21,875 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:00:21,875 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-26 01:00:21,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:00:21 BoogieIcfgContainer [2022-11-26 01:00:21,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:00:21,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:00:21,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:00:21,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:00:21,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:00:19" (1/3) ... [2022-11-26 01:00:21,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f439f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:00:21, skipping insertion in model container [2022-11-26 01:00:21,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:00:20" (2/3) ... [2022-11-26 01:00:21,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f439f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:00:21, skipping insertion in model container [2022-11-26 01:00:21,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:00:21" (3/3) ... [2022-11-26 01:00:21,892 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2022-11-26 01:00:21,901 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 01:00:21,912 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:00:21,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 01:00:21,913 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 01:00:22,229 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-26 01:00:22,305 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 01:00:22,321 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 698 places, 761 transitions, 1546 flow [2022-11-26 01:00:22,325 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 698 places, 761 transitions, 1546 flow [2022-11-26 01:00:22,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 698 places, 761 transitions, 1546 flow [2022-11-26 01:00:22,803 INFO L130 PetriNetUnfolder]: 73/758 cut-off events. [2022-11-26 01:00:22,804 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-26 01:00:22,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 758 events. 73/758 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2695 event pairs, 0 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 559. Up to 2 conditions per place. [2022-11-26 01:00:22,910 INFO L119 LiptonReduction]: Number of co-enabled transitions 187758 [2022-11-26 01:01:08,427 INFO L134 LiptonReduction]: Checked pairs total: 177040 [2022-11-26 01:01:08,427 INFO L136 LiptonReduction]: Total number of compositions: 957 [2022-11-26 01:01:08,438 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 54 transitions, 132 flow [2022-11-26 01:01:08,552 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 893 states, 892 states have (on average 4.208520179372197) internal successors, (3754), 892 states have internal predecessors, (3754), 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) [2022-11-26 01:01:08,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:01:08,584 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@494c2f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:01:08,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-26 01:01:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 893 states, 892 states have (on average 4.208520179372197) internal successors, (3754), 892 states have internal predecessors, (3754), 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) [2022-11-26 01:01:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 01:01:08,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:08,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:08,616 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:08,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1131908587, now seen corresponding path program 1 times [2022-11-26 01:01:08,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:08,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687875331] [2022-11-26 01:01:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:01:09,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:09,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687875331] [2022-11-26 01:01:09,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687875331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:09,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:09,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:01:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960174854] [2022-11-26 01:01:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:09,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:09,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:09,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:09,294 INFO L87 Difference]: Start difference. First operand has 893 states, 892 states have (on average 4.208520179372197) internal successors, (3754), 892 states have internal predecessors, (3754), 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 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-11-26 01:01:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:09,587 INFO L93 Difference]: Finished difference Result 896 states and 3671 transitions. [2022-11-26 01:01:09,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:09,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-11-26 01:01:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:09,640 INFO L225 Difference]: With dead ends: 896 [2022-11-26 01:01:09,640 INFO L226 Difference]: Without dead ends: 896 [2022-11-26 01:01:09,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:09,649 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:09,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-11-26 01:01:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2022-11-26 01:01:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 4.101675977653631) internal successors, (3671), 895 states have internal predecessors, (3671), 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) [2022-11-26 01:01:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 3671 transitions. [2022-11-26 01:01:09,814 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 3671 transitions. Word has length 19 [2022-11-26 01:01:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:09,815 INFO L495 AbstractCegarLoop]: Abstraction has 896 states and 3671 transitions. [2022-11-26 01:01:09,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-11-26 01:01:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 3671 transitions. [2022-11-26 01:01:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 01:01:09,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:09,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:09,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:01:09,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:09,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1135962520, now seen corresponding path program 1 times [2022-11-26 01:01:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:09,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122426703] [2022-11-26 01:01:09,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:01:10,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:10,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122426703] [2022-11-26 01:01:10,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122426703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:10,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793917900] [2022-11-26 01:01:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:10,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:10,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:10,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:10,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:01:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:10,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:01:10,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:01:10,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:01:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793917900] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:01:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1276536573] [2022-11-26 01:01:10,674 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:01:10,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:01:10,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-11-26 01:01:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929329151] [2022-11-26 01:01:10,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:01:10,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 01:01:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:10,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 01:01:10,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:01:10,684 INFO L87 Difference]: Start difference. First operand 896 states and 3671 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2022-11-26 01:01:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:10,906 INFO L93 Difference]: Finished difference Result 905 states and 3680 transitions. [2022-11-26 01:01:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:01:10,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 22 [2022-11-26 01:01:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:10,916 INFO L225 Difference]: With dead ends: 905 [2022-11-26 01:01:10,916 INFO L226 Difference]: Without dead ends: 905 [2022-11-26 01:01:10,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:01:10,920 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:10,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-11-26 01:01:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2022-11-26 01:01:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 4.070796460176991) internal successors, (3680), 904 states have internal predecessors, (3680), 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) [2022-11-26 01:01:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 3680 transitions. [2022-11-26 01:01:10,984 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 3680 transitions. Word has length 22 [2022-11-26 01:01:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:10,985 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 3680 transitions. [2022-11-26 01:01:10,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2022-11-26 01:01:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 3680 transitions. [2022-11-26 01:01:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 01:01:10,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:10,990 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:11,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:11,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:11,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:11,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash 50064213, now seen corresponding path program 2 times [2022-11-26 01:01:11,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:11,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402282441] [2022-11-26 01:01:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:11,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-26 01:01:11,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:11,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402282441] [2022-11-26 01:01:11,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402282441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:11,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960726992] [2022-11-26 01:01:11,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:01:11,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:11,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:11,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:11,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:01:11,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 01:01:11,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:01:11,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 01:01:11,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-26 01:01:14,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:01:14,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960726992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:14,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:01:14,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-26 01:01:14,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400503966] [2022-11-26 01:01:14,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:14,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:14,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:14,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-26 01:01:14,088 INFO L87 Difference]: Start difference. First operand 905 states and 3680 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:15,230 INFO L93 Difference]: Finished difference Result 1084 states and 4199 transitions. [2022-11-26 01:01:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:15,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 31 [2022-11-26 01:01:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:15,241 INFO L225 Difference]: With dead ends: 1084 [2022-11-26 01:01:15,241 INFO L226 Difference]: Without dead ends: 1077 [2022-11-26 01:01:15,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-26 01:01:15,243 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:15,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:01:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2022-11-26 01:01:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 921. [2022-11-26 01:01:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 4.043478260869565) internal successors, (3720), 920 states have internal predecessors, (3720), 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) [2022-11-26 01:01:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 3720 transitions. [2022-11-26 01:01:15,295 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 3720 transitions. Word has length 31 [2022-11-26 01:01:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:15,296 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 3720 transitions. [2022-11-26 01:01:15,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 3720 transitions. [2022-11-26 01:01:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 01:01:15,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:15,301 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:15,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:15,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:15,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1832212585, now seen corresponding path program 3 times [2022-11-26 01:01:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:15,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959938321] [2022-11-26 01:01:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-26 01:01:15,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:15,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959938321] [2022-11-26 01:01:15,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959938321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:15,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914215561] [2022-11-26 01:01:15,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:01:15,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:15,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:15,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:01:16,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:01:16,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:01:16,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 01:01:16,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-26 01:01:16,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-26 01:01:16,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914215561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:01:16,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [642736463] [2022-11-26 01:01:16,359 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:01:16,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:01:16,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-11-26 01:01:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340510727] [2022-11-26 01:01:16,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:01:16,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 01:01:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 01:01:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-26 01:01:16,361 INFO L87 Difference]: Start difference. First operand 921 states and 3720 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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) [2022-11-26 01:01:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:16,672 INFO L93 Difference]: Finished difference Result 924 states and 3723 transitions. [2022-11-26 01:01:16,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:01:16,672 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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 31 [2022-11-26 01:01:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:16,680 INFO L225 Difference]: With dead ends: 924 [2022-11-26 01:01:16,680 INFO L226 Difference]: Without dead ends: 924 [2022-11-26 01:01:16,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-26 01:01:16,683 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:16,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:01:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-11-26 01:01:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2022-11-26 01:01:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 4.033586132177682) internal successors, (3723), 923 states have internal predecessors, (3723), 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) [2022-11-26 01:01:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 3723 transitions. [2022-11-26 01:01:16,728 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 3723 transitions. Word has length 31 [2022-11-26 01:01:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:16,729 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 3723 transitions. [2022-11-26 01:01:16,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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) [2022-11-26 01:01:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 3723 transitions. [2022-11-26 01:01:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 01:01:16,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:16,734 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:16,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:16,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:16,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:16,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1922437482, now seen corresponding path program 4 times [2022-11-26 01:01:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:16,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835426301] [2022-11-26 01:01:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:19,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:19,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835426301] [2022-11-26 01:01:19,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835426301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:19,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:19,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239184306] [2022-11-26 01:01:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:19,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:19,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:19,142 INFO L87 Difference]: Start difference. First operand 924 states and 3723 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:20,012 INFO L93 Difference]: Finished difference Result 1273 states and 4826 transitions. [2022-11-26 01:01:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 34 [2022-11-26 01:01:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:20,022 INFO L225 Difference]: With dead ends: 1273 [2022-11-26 01:01:20,023 INFO L226 Difference]: Without dead ends: 1266 [2022-11-26 01:01:20,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:01:20,024 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:20,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:01:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-11-26 01:01:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 928. [2022-11-26 01:01:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 4.023732470334412) internal successors, (3730), 927 states have internal predecessors, (3730), 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) [2022-11-26 01:01:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 3730 transitions. [2022-11-26 01:01:20,071 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 3730 transitions. Word has length 34 [2022-11-26 01:01:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:20,073 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 3730 transitions. [2022-11-26 01:01:20,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 3730 transitions. [2022-11-26 01:01:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 01:01:20,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:20,077 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:20,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:01:20,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:20,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1999508060, now seen corresponding path program 5 times [2022-11-26 01:01:20,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:20,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998389729] [2022-11-26 01:01:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:20,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:21,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:21,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998389729] [2022-11-26 01:01:21,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998389729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:21,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:21,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028619303] [2022-11-26 01:01:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:21,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:21,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:21,964 INFO L87 Difference]: Start difference. First operand 928 states and 3730 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:22,614 INFO L93 Difference]: Finished difference Result 1749 states and 6930 transitions. [2022-11-26 01:01:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:22,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 34 [2022-11-26 01:01:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:22,628 INFO L225 Difference]: With dead ends: 1749 [2022-11-26 01:01:22,628 INFO L226 Difference]: Without dead ends: 1742 [2022-11-26 01:01:22,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:01:22,630 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:22,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:01:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2022-11-26 01:01:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 932. [2022-11-26 01:01:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 4.022556390977444) internal successors, (3745), 931 states have internal predecessors, (3745), 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) [2022-11-26 01:01:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3745 transitions. [2022-11-26 01:01:22,681 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3745 transitions. Word has length 34 [2022-11-26 01:01:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:22,683 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 3745 transitions. [2022-11-26 01:01:22,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3745 transitions. [2022-11-26 01:01:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 01:01:22,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:22,690 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:22,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 01:01:22,690 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1717477090, now seen corresponding path program 6 times [2022-11-26 01:01:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:22,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465175074] [2022-11-26 01:01:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:24,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:24,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465175074] [2022-11-26 01:01:24,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465175074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:24,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:24,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:24,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044576048] [2022-11-26 01:01:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:24,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:24,247 INFO L87 Difference]: Start difference. First operand 932 states and 3745 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:25,257 INFO L93 Difference]: Finished difference Result 2417 states and 9784 transitions. [2022-11-26 01:01:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:01:25,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 34 [2022-11-26 01:01:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:25,276 INFO L225 Difference]: With dead ends: 2417 [2022-11-26 01:01:25,276 INFO L226 Difference]: Without dead ends: 2410 [2022-11-26 01:01:25,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:01:25,277 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:25,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-26 01:01:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-11-26 01:01:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 934. [2022-11-26 01:01:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 4.017148981779207) internal successors, (3748), 933 states have internal predecessors, (3748), 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) [2022-11-26 01:01:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 3748 transitions. [2022-11-26 01:01:25,339 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 3748 transitions. Word has length 34 [2022-11-26 01:01:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:25,340 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 3748 transitions. [2022-11-26 01:01:25,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 3748 transitions. [2022-11-26 01:01:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 01:01:25,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:25,344 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:25,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 01:01:25,345 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:25,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1648701614, now seen corresponding path program 7 times [2022-11-26 01:01:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:25,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615855872] [2022-11-26 01:01:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:26,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:26,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615855872] [2022-11-26 01:01:26,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615855872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:26,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:26,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493135483] [2022-11-26 01:01:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:26,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:26,856 INFO L87 Difference]: Start difference. First operand 934 states and 3748 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:27,734 INFO L93 Difference]: Finished difference Result 2383 states and 9507 transitions. [2022-11-26 01:01:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:01:27,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 34 [2022-11-26 01:01:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:27,753 INFO L225 Difference]: With dead ends: 2383 [2022-11-26 01:01:27,753 INFO L226 Difference]: Without dead ends: 2376 [2022-11-26 01:01:27,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:01:27,754 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:27,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 01:01:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2022-11-26 01:01:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 936. [2022-11-26 01:01:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 4.0181818181818185) internal successors, (3757), 935 states have internal predecessors, (3757), 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) [2022-11-26 01:01:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 3757 transitions. [2022-11-26 01:01:27,813 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 3757 transitions. Word has length 34 [2022-11-26 01:01:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:27,813 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 3757 transitions. [2022-11-26 01:01:27,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 3757 transitions. [2022-11-26 01:01:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 01:01:27,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:27,817 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:27,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 01:01:27,818 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:27,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:27,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1790959028, now seen corresponding path program 8 times [2022-11-26 01:01:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:27,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645204836] [2022-11-26 01:01:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:29,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:29,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645204836] [2022-11-26 01:01:29,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645204836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:29,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:29,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:29,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947437174] [2022-11-26 01:01:29,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:29,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:29,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:29,177 INFO L87 Difference]: Start difference. First operand 936 states and 3757 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:29,895 INFO L93 Difference]: Finished difference Result 1551 states and 6048 transitions. [2022-11-26 01:01:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:29,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 34 [2022-11-26 01:01:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:29,920 INFO L225 Difference]: With dead ends: 1551 [2022-11-26 01:01:29,921 INFO L226 Difference]: Without dead ends: 1544 [2022-11-26 01:01:29,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:01:29,927 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:29,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:01:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2022-11-26 01:01:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 936. [2022-11-26 01:01:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 4.0181818181818185) internal successors, (3757), 935 states have internal predecessors, (3757), 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) [2022-11-26 01:01:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 3757 transitions. [2022-11-26 01:01:29,977 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 3757 transitions. Word has length 34 [2022-11-26 01:01:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:29,977 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 3757 transitions. [2022-11-26 01:01:29,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-11-26 01:01:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 3757 transitions. [2022-11-26 01:01:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:01:29,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:29,982 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:29,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 01:01:29,982 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1981509212, now seen corresponding path program 1 times [2022-11-26 01:01:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219824774] [2022-11-26 01:01:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:29,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:30,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:30,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219824774] [2022-11-26 01:01:30,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219824774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:30,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:30,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:01:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447991675] [2022-11-26 01:01:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:30,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:30,208 INFO L87 Difference]: Start difference. First operand 936 states and 3757 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2022-11-26 01:01:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:30,368 INFO L93 Difference]: Finished difference Result 1158 states and 4647 transitions. [2022-11-26 01:01:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 35 [2022-11-26 01:01:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:30,376 INFO L225 Difference]: With dead ends: 1158 [2022-11-26 01:01:30,376 INFO L226 Difference]: Without dead ends: 1158 [2022-11-26 01:01:30,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:30,377 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:30,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-11-26 01:01:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2022-11-26 01:01:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 4.016421780466724) internal successors, (4647), 1157 states have internal predecessors, (4647), 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) [2022-11-26 01:01:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 4647 transitions. [2022-11-26 01:01:30,420 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 4647 transitions. Word has length 35 [2022-11-26 01:01:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:30,420 INFO L495 AbstractCegarLoop]: Abstraction has 1158 states and 4647 transitions. [2022-11-26 01:01:30,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2022-11-26 01:01:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 4647 transitions. [2022-11-26 01:01:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:01:30,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:30,425 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 01:01:30,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash 876084420, now seen corresponding path program 1 times [2022-11-26 01:01:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265743775] [2022-11-26 01:01:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:30,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:30,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265743775] [2022-11-26 01:01:30,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265743775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:30,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:30,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:01:30,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245078737] [2022-11-26 01:01:30,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:30,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:30,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:30,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:30,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:30,634 INFO L87 Difference]: Start difference. First operand 1158 states and 4647 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2022-11-26 01:01:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:30,824 INFO L93 Difference]: Finished difference Result 1806 states and 7251 transitions. [2022-11-26 01:01:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:30,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 35 [2022-11-26 01:01:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:30,835 INFO L225 Difference]: With dead ends: 1806 [2022-11-26 01:01:30,835 INFO L226 Difference]: Without dead ends: 1806 [2022-11-26 01:01:30,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:30,836 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:30,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-11-26 01:01:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1698. [2022-11-26 01:01:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1697 states have (on average 4.027695934001178) internal successors, (6835), 1697 states have internal predecessors, (6835), 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) [2022-11-26 01:01:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 6835 transitions. [2022-11-26 01:01:30,904 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 6835 transitions. Word has length 35 [2022-11-26 01:01:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:30,904 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 6835 transitions. [2022-11-26 01:01:30,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2022-11-26 01:01:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 6835 transitions. [2022-11-26 01:01:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:01:30,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:30,911 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:30,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 01:01:30,911 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1461094484, now seen corresponding path program 1 times [2022-11-26 01:01:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:30,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292984543] [2022-11-26 01:01:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:31,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:31,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292984543] [2022-11-26 01:01:31,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292984543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:31,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:31,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:01:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20049409] [2022-11-26 01:01:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:31,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:01:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:31,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:01:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:31,182 INFO L87 Difference]: Start difference. First operand 1698 states and 6835 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2022-11-26 01:01:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:31,376 INFO L93 Difference]: Finished difference Result 2610 states and 10491 transitions. [2022-11-26 01:01:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:01:31,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 35 [2022-11-26 01:01:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:31,392 INFO L225 Difference]: With dead ends: 2610 [2022-11-26 01:01:31,392 INFO L226 Difference]: Without dead ends: 2610 [2022-11-26 01:01:31,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:01:31,393 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:31,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2022-11-26 01:01:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2306. [2022-11-26 01:01:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 4.04468546637744) internal successors, (9323), 2305 states have internal predecessors, (9323), 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) [2022-11-26 01:01:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 9323 transitions. [2022-11-26 01:01:31,488 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 9323 transitions. Word has length 35 [2022-11-26 01:01:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:31,489 INFO L495 AbstractCegarLoop]: Abstraction has 2306 states and 9323 transitions. [2022-11-26 01:01:31,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2022-11-26 01:01:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 9323 transitions. [2022-11-26 01:01:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 01:01:31,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:31,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:31,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 01:01:31,497 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:31,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1298484621, now seen corresponding path program 1 times [2022-11-26 01:01:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:31,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87064522] [2022-11-26 01:01:31,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:32,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:32,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87064522] [2022-11-26 01:01:32,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87064522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:32,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:32,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:01:32,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89078189] [2022-11-26 01:01:32,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:32,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:01:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:32,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:01:32,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:01:32,075 INFO L87 Difference]: Start difference. First operand 2306 states and 9323 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-11-26 01:01:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:32,573 INFO L93 Difference]: Finished difference Result 3639 states and 13351 transitions. [2022-11-26 01:01:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:32,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 36 [2022-11-26 01:01:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:32,591 INFO L225 Difference]: With dead ends: 3639 [2022-11-26 01:01:32,592 INFO L226 Difference]: Without dead ends: 3444 [2022-11-26 01:01:32,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:01:32,592 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:32,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:01:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2022-11-26 01:01:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 2384. [2022-11-26 01:01:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2383 states have (on average 3.9983214435585395) internal successors, (9528), 2383 states have internal predecessors, (9528), 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) [2022-11-26 01:01:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 9528 transitions. [2022-11-26 01:01:32,776 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 9528 transitions. Word has length 36 [2022-11-26 01:01:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:32,776 INFO L495 AbstractCegarLoop]: Abstraction has 2384 states and 9528 transitions. [2022-11-26 01:01:32,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-11-26 01:01:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 9528 transitions. [2022-11-26 01:01:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 01:01:32,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:32,785 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:32,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 01:01:32,785 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -252631185, now seen corresponding path program 2 times [2022-11-26 01:01:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315158739] [2022-11-26 01:01:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:32,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:33,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:33,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315158739] [2022-11-26 01:01:33,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315158739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:33,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:33,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:01:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078419702] [2022-11-26 01:01:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:33,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:33,442 INFO L87 Difference]: Start difference. First operand 2384 states and 9528 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-11-26 01:01:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:33,731 INFO L93 Difference]: Finished difference Result 2659 states and 10302 transitions. [2022-11-26 01:01:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 36 [2022-11-26 01:01:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:33,746 INFO L225 Difference]: With dead ends: 2659 [2022-11-26 01:01:33,746 INFO L226 Difference]: Without dead ends: 2472 [2022-11-26 01:01:33,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:33,747 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:33,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2022-11-26 01:01:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2410. [2022-11-26 01:01:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2409 states have (on average 3.9597343295973433) internal successors, (9539), 2409 states have internal predecessors, (9539), 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) [2022-11-26 01:01:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9539 transitions. [2022-11-26 01:01:33,839 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9539 transitions. Word has length 36 [2022-11-26 01:01:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:33,839 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 9539 transitions. [2022-11-26 01:01:33,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-11-26 01:01:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9539 transitions. [2022-11-26 01:01:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 01:01:33,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:33,849 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:33,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 01:01:33,849 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:33,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1284229807, now seen corresponding path program 1 times [2022-11-26 01:01:33,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:33,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182591027] [2022-11-26 01:01:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:33,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:34,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:34,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182591027] [2022-11-26 01:01:34,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182591027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:34,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:34,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:34,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625299195] [2022-11-26 01:01:34,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:34,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:34,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:34,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:34,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:34,901 INFO L87 Difference]: Start difference. First operand 2410 states and 9539 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:35,302 INFO L93 Difference]: Finished difference Result 2743 states and 10386 transitions. [2022-11-26 01:01:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:35,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 40 [2022-11-26 01:01:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:35,315 INFO L225 Difference]: With dead ends: 2743 [2022-11-26 01:01:35,315 INFO L226 Difference]: Without dead ends: 2656 [2022-11-26 01:01:35,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:01:35,316 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:35,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:01:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2022-11-26 01:01:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2410. [2022-11-26 01:01:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2409 states have (on average 3.958073889580739) internal successors, (9535), 2409 states have internal predecessors, (9535), 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) [2022-11-26 01:01:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9535 transitions. [2022-11-26 01:01:35,403 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9535 transitions. Word has length 40 [2022-11-26 01:01:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:35,403 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 9535 transitions. [2022-11-26 01:01:35,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9535 transitions. [2022-11-26 01:01:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 01:01:35,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:35,413 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:35,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 01:01:35,413 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:35,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1397044235, now seen corresponding path program 2 times [2022-11-26 01:01:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:35,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367155945] [2022-11-26 01:01:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:35,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:36,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:36,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367155945] [2022-11-26 01:01:36,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367155945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:36,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:36,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:36,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984649368] [2022-11-26 01:01:36,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:36,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:36,454 INFO L87 Difference]: Start difference. First operand 2410 states and 9535 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:37,019 INFO L93 Difference]: Finished difference Result 2825 states and 10539 transitions. [2022-11-26 01:01:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:01:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 40 [2022-11-26 01:01:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:37,033 INFO L225 Difference]: With dead ends: 2825 [2022-11-26 01:01:37,033 INFO L226 Difference]: Without dead ends: 2792 [2022-11-26 01:01:37,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:01:37,034 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:37,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:01:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2022-11-26 01:01:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2410. [2022-11-26 01:01:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2409 states have (on average 3.9572436695724367) internal successors, (9533), 2409 states have internal predecessors, (9533), 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) [2022-11-26 01:01:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9533 transitions. [2022-11-26 01:01:37,126 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9533 transitions. Word has length 40 [2022-11-26 01:01:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:37,126 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 9533 transitions. [2022-11-26 01:01:37,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9533 transitions. [2022-11-26 01:01:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 01:01:37,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:37,136 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:37,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 01:01:37,136 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:37,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:37,137 INFO L85 PathProgramCache]: Analyzing trace with hash 986419167, now seen corresponding path program 3 times [2022-11-26 01:01:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:37,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192275802] [2022-11-26 01:01:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:38,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192275802] [2022-11-26 01:01:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192275802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:38,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:38,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987183159] [2022-11-26 01:01:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:38,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:38,126 INFO L87 Difference]: Start difference. First operand 2410 states and 9533 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:38,638 INFO L93 Difference]: Finished difference Result 2649 states and 10073 transitions. [2022-11-26 01:01:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:38,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 40 [2022-11-26 01:01:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:38,653 INFO L225 Difference]: With dead ends: 2649 [2022-11-26 01:01:38,653 INFO L226 Difference]: Without dead ends: 2634 [2022-11-26 01:01:38,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:01:38,654 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:38,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:01:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-11-26 01:01:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2458. [2022-11-26 01:01:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2457 states have (on average 3.9263329263329263) internal successors, (9647), 2457 states have internal predecessors, (9647), 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) [2022-11-26 01:01:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 9647 transitions. [2022-11-26 01:01:38,746 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 9647 transitions. Word has length 40 [2022-11-26 01:01:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:38,746 INFO L495 AbstractCegarLoop]: Abstraction has 2458 states and 9647 transitions. [2022-11-26 01:01:38,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 9647 transitions. [2022-11-26 01:01:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 01:01:38,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:38,756 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:38,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 01:01:38,756 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:38,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:38,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1018024821, now seen corresponding path program 4 times [2022-11-26 01:01:38,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:38,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321488430] [2022-11-26 01:01:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:38,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:39,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:39,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321488430] [2022-11-26 01:01:39,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321488430] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:39,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467783010] [2022-11-26 01:01:39,942 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:01:39,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:39,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:39,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:39,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:01:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:40,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 01:01:40,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:40,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:41,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467783010] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:01:41,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2099551637] [2022-11-26 01:01:41,571 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:01:41,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:01:41,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-11-26 01:01:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909619432] [2022-11-26 01:01:41,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:01:41,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 01:01:41,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 01:01:41,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-26 01:01:41,575 INFO L87 Difference]: Start difference. First operand 2458 states and 9647 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 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) [2022-11-26 01:01:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:42,594 INFO L93 Difference]: Finished difference Result 3977 states and 15127 transitions. [2022-11-26 01:01:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:01:42,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 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 40 [2022-11-26 01:01:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:42,616 INFO L225 Difference]: With dead ends: 3977 [2022-11-26 01:01:42,617 INFO L226 Difference]: Without dead ends: 3898 [2022-11-26 01:01:42,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-26 01:01:42,618 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:42,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 01:01:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2022-11-26 01:01:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 2410. [2022-11-26 01:01:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2409 states have (on average 3.934827729348277) internal successors, (9479), 2409 states have internal predecessors, (9479), 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) [2022-11-26 01:01:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9479 transitions. [2022-11-26 01:01:42,736 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9479 transitions. Word has length 40 [2022-11-26 01:01:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:42,737 INFO L495 AbstractCegarLoop]: Abstraction has 2410 states and 9479 transitions. [2022-11-26 01:01:42,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 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) [2022-11-26 01:01:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9479 transitions. [2022-11-26 01:01:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 01:01:42,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:42,746 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:42,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:42,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 01:01:42,954 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash 792131529, now seen corresponding path program 5 times [2022-11-26 01:01:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:42,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768725968] [2022-11-26 01:01:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:44,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:44,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768725968] [2022-11-26 01:01:44,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768725968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:44,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:44,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458197491] [2022-11-26 01:01:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:44,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:44,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:44,212 INFO L87 Difference]: Start difference. First operand 2410 states and 9479 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:44,810 INFO L93 Difference]: Finished difference Result 2925 states and 10884 transitions. [2022-11-26 01:01:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:44,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 40 [2022-11-26 01:01:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:44,825 INFO L225 Difference]: With dead ends: 2925 [2022-11-26 01:01:44,825 INFO L226 Difference]: Without dead ends: 2894 [2022-11-26 01:01:44,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:01:44,826 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:44,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:01:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2022-11-26 01:01:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2434. [2022-11-26 01:01:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 3.923962186600904) internal successors, (9547), 2433 states have internal predecessors, (9547), 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) [2022-11-26 01:01:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9547 transitions. [2022-11-26 01:01:44,917 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9547 transitions. Word has length 40 [2022-11-26 01:01:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:44,917 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 9547 transitions. [2022-11-26 01:01:44,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9547 transitions. [2022-11-26 01:01:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 01:01:44,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:44,927 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:44,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-26 01:01:44,928 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1055713381, now seen corresponding path program 6 times [2022-11-26 01:01:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:44,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718417158] [2022-11-26 01:01:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:44,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:45,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:45,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718417158] [2022-11-26 01:01:45,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718417158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:45,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:45,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118405499] [2022-11-26 01:01:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:45,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:45,923 INFO L87 Difference]: Start difference. First operand 2434 states and 9547 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:46,568 INFO L93 Difference]: Finished difference Result 3161 states and 11508 transitions. [2022-11-26 01:01:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:01:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 40 [2022-11-26 01:01:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:46,583 INFO L225 Difference]: With dead ends: 3161 [2022-11-26 01:01:46,584 INFO L226 Difference]: Without dead ends: 3128 [2022-11-26 01:01:46,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:01:46,585 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:46,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:01:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2022-11-26 01:01:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2434. [2022-11-26 01:01:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 3.923140156185779) internal successors, (9545), 2433 states have internal predecessors, (9545), 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) [2022-11-26 01:01:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9545 transitions. [2022-11-26 01:01:46,679 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9545 transitions. Word has length 40 [2022-11-26 01:01:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:46,679 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 9545 transitions. [2022-11-26 01:01:46,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9545 transitions. [2022-11-26 01:01:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 01:01:46,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:46,689 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:46,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 01:01:46,689 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2022911017, now seen corresponding path program 7 times [2022-11-26 01:01:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:46,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487920188] [2022-11-26 01:01:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:48,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:48,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487920188] [2022-11-26 01:01:48,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487920188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:48,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:48,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036773041] [2022-11-26 01:01:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:48,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:01:48,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:01:48,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:48,031 INFO L87 Difference]: Start difference. First operand 2434 states and 9545 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:48,537 INFO L93 Difference]: Finished difference Result 3285 states and 11974 transitions. [2022-11-26 01:01:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 40 [2022-11-26 01:01:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:48,559 INFO L225 Difference]: With dead ends: 3285 [2022-11-26 01:01:48,559 INFO L226 Difference]: Without dead ends: 3254 [2022-11-26 01:01:48,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:01:48,560 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:48,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:01:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-11-26 01:01:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 2434. [2022-11-26 01:01:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 3.923140156185779) internal successors, (9545), 2433 states have internal predecessors, (9545), 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) [2022-11-26 01:01:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9545 transitions. [2022-11-26 01:01:48,692 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9545 transitions. Word has length 40 [2022-11-26 01:01:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:48,693 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 9545 transitions. [2022-11-26 01:01:48,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-11-26 01:01:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9545 transitions. [2022-11-26 01:01:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-26 01:01:48,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:48,705 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:48,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-26 01:01:48,706 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash -94185762, now seen corresponding path program 1 times [2022-11-26 01:01:48,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:48,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213952368] [2022-11-26 01:01:48,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:48,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:49,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213952368] [2022-11-26 01:01:49,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213952368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:49,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:49,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:01:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233022543] [2022-11-26 01:01:49,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:49,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:49,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:49,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:49,082 INFO L87 Difference]: Start difference. First operand 2434 states and 9545 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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) [2022-11-26 01:01:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:49,312 INFO L93 Difference]: Finished difference Result 2643 states and 10011 transitions. [2022-11-26 01:01:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2022-11-26 01:01:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:49,324 INFO L225 Difference]: With dead ends: 2643 [2022-11-26 01:01:49,324 INFO L226 Difference]: Without dead ends: 2486 [2022-11-26 01:01:49,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:49,326 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:49,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-11-26 01:01:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2426. [2022-11-26 01:01:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2425 states have (on average 3.9257731958762885) internal successors, (9520), 2425 states have internal predecessors, (9520), 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) [2022-11-26 01:01:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 9520 transitions. [2022-11-26 01:01:49,402 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 9520 transitions. Word has length 41 [2022-11-26 01:01:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:49,403 INFO L495 AbstractCegarLoop]: Abstraction has 2426 states and 9520 transitions. [2022-11-26 01:01:49,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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) [2022-11-26 01:01:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 9520 transitions. [2022-11-26 01:01:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-26 01:01:49,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:49,411 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:49,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-26 01:01:49,411 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1976929776, now seen corresponding path program 2 times [2022-11-26 01:01:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:49,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598206660] [2022-11-26 01:01:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:49,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:49,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598206660] [2022-11-26 01:01:49,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598206660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:01:49,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548699203] [2022-11-26 01:01:49,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:01:49,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:01:49,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:01:49,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:01:50,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 01:01:50,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:01:50,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 01:01:50,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:01:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:50,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:01:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:01:50,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548699203] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:01:50,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1885590330] [2022-11-26 01:01:50,529 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:01:50,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:01:50,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-11-26 01:01:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289503048] [2022-11-26 01:01:50,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:01:50,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 01:01:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 01:01:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:01:50,533 INFO L87 Difference]: Start difference. First operand 2426 states and 9520 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 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) [2022-11-26 01:01:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:50,977 INFO L93 Difference]: Finished difference Result 2667 states and 10196 transitions. [2022-11-26 01:01:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:50,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 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 41 [2022-11-26 01:01:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:50,989 INFO L225 Difference]: With dead ends: 2667 [2022-11-26 01:01:50,989 INFO L226 Difference]: Without dead ends: 2522 [2022-11-26 01:01:50,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-26 01:01:50,991 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:50,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:01:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-11-26 01:01:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2368. [2022-11-26 01:01:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2367 states have (on average 3.955217574989438) internal successors, (9362), 2367 states have internal predecessors, (9362), 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) [2022-11-26 01:01:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 9362 transitions. [2022-11-26 01:01:51,065 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 9362 transitions. Word has length 41 [2022-11-26 01:01:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:51,065 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 9362 transitions. [2022-11-26 01:01:51,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 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) [2022-11-26 01:01:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 9362 transitions. [2022-11-26 01:01:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-26 01:01:51,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:51,073 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:51,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:01:51,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:01:51,281 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash -994783482, now seen corresponding path program 1 times [2022-11-26 01:01:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:51,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245746058] [2022-11-26 01:01:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 01:01:51,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:51,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245746058] [2022-11-26 01:01:51,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245746058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:51,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:51,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:51,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843697717] [2022-11-26 01:01:51,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:51,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:51,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:51,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:51,884 INFO L87 Difference]: Start difference. First operand 2368 states and 9362 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2022-11-26 01:01:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:52,139 INFO L93 Difference]: Finished difference Result 2472 states and 9625 transitions. [2022-11-26 01:01:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 42 [2022-11-26 01:01:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:52,151 INFO L225 Difference]: With dead ends: 2472 [2022-11-26 01:01:52,151 INFO L226 Difference]: Without dead ends: 2462 [2022-11-26 01:01:52,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:52,153 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:52,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2022-11-26 01:01:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2364. [2022-11-26 01:01:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2363 states have (on average 3.958104104951333) internal successors, (9353), 2363 states have internal predecessors, (9353), 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) [2022-11-26 01:01:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 9353 transitions. [2022-11-26 01:01:52,229 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 9353 transitions. Word has length 42 [2022-11-26 01:01:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:52,230 INFO L495 AbstractCegarLoop]: Abstraction has 2364 states and 9353 transitions. [2022-11-26 01:01:52,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2022-11-26 01:01:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 9353 transitions. [2022-11-26 01:01:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-26 01:01:52,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:52,241 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:52,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-26 01:01:52,241 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1859123112, now seen corresponding path program 2 times [2022-11-26 01:01:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:52,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242687754] [2022-11-26 01:01:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 01:01:52,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:52,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242687754] [2022-11-26 01:01:52,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242687754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:52,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:52,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124717347] [2022-11-26 01:01:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:52,953 INFO L87 Difference]: Start difference. First operand 2364 states and 9353 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2022-11-26 01:01:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:53,216 INFO L93 Difference]: Finished difference Result 2490 states and 9676 transitions. [2022-11-26 01:01:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 42 [2022-11-26 01:01:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:53,228 INFO L225 Difference]: With dead ends: 2490 [2022-11-26 01:01:53,228 INFO L226 Difference]: Without dead ends: 2484 [2022-11-26 01:01:53,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:53,234 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:53,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-11-26 01:01:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2364. [2022-11-26 01:01:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2363 states have (on average 3.9555649597968685) internal successors, (9347), 2363 states have internal predecessors, (9347), 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) [2022-11-26 01:01:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 9347 transitions. [2022-11-26 01:01:53,307 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 9347 transitions. Word has length 42 [2022-11-26 01:01:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:53,307 INFO L495 AbstractCegarLoop]: Abstraction has 2364 states and 9347 transitions. [2022-11-26 01:01:53,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2022-11-26 01:01:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 9347 transitions. [2022-11-26 01:01:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-26 01:01:53,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:53,319 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:53,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-26 01:01:53,319 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1477914098, now seen corresponding path program 3 times [2022-11-26 01:01:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:53,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386153713] [2022-11-26 01:01:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 01:01:53,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:53,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386153713] [2022-11-26 01:01:53,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386153713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:53,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:53,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:53,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890679953] [2022-11-26 01:01:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:53,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:53,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:53,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:53,958 INFO L87 Difference]: Start difference. First operand 2364 states and 9347 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2022-11-26 01:01:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:54,159 INFO L93 Difference]: Finished difference Result 2392 states and 9338 transitions. [2022-11-26 01:01:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:54,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 42 [2022-11-26 01:01:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:54,170 INFO L225 Difference]: With dead ends: 2392 [2022-11-26 01:01:54,171 INFO L226 Difference]: Without dead ends: 2392 [2022-11-26 01:01:54,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:54,172 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:54,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2022-11-26 01:01:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2278. [2022-11-26 01:01:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 3.9301712779973648) internal successors, (8949), 2277 states have internal predecessors, (8949), 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) [2022-11-26 01:01:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 8949 transitions. [2022-11-26 01:01:54,243 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 8949 transitions. Word has length 42 [2022-11-26 01:01:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:54,243 INFO L495 AbstractCegarLoop]: Abstraction has 2278 states and 8949 transitions. [2022-11-26 01:01:54,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2022-11-26 01:01:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 8949 transitions. [2022-11-26 01:01:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 01:01:54,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:54,251 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:54,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-26 01:01:54,252 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash -934906823, now seen corresponding path program 1 times [2022-11-26 01:01:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:54,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870224997] [2022-11-26 01:01:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:54,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:54,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870224997] [2022-11-26 01:01:54,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870224997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:54,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:54,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021496945] [2022-11-26 01:01:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:54,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:54,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:54,907 INFO L87 Difference]: Start difference. First operand 2278 states and 8949 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:55,171 INFO L93 Difference]: Finished difference Result 3490 states and 13027 transitions. [2022-11-26 01:01:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:55,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 47 [2022-11-26 01:01:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:55,186 INFO L225 Difference]: With dead ends: 3490 [2022-11-26 01:01:55,186 INFO L226 Difference]: Without dead ends: 3490 [2022-11-26 01:01:55,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:55,187 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:55,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2022-11-26 01:01:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3036. [2022-11-26 01:01:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3035 states have (on average 3.8658978583196046) internal successors, (11733), 3035 states have internal predecessors, (11733), 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) [2022-11-26 01:01:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 11733 transitions. [2022-11-26 01:01:55,288 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 11733 transitions. Word has length 47 [2022-11-26 01:01:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:55,288 INFO L495 AbstractCegarLoop]: Abstraction has 3036 states and 11733 transitions. [2022-11-26 01:01:55,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 11733 transitions. [2022-11-26 01:01:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 01:01:55,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:55,299 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:55,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-26 01:01:55,299 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash 681123969, now seen corresponding path program 2 times [2022-11-26 01:01:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:55,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300199741] [2022-11-26 01:01:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:55,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 01:01:55,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:55,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300199741] [2022-11-26 01:01:55,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300199741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:55,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:55,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809122289] [2022-11-26 01:01:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:55,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:55,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:55,856 INFO L87 Difference]: Start difference. First operand 3036 states and 11733 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:56,145 INFO L93 Difference]: Finished difference Result 3490 states and 12999 transitions. [2022-11-26 01:01:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 47 [2022-11-26 01:01:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:56,161 INFO L225 Difference]: With dead ends: 3490 [2022-11-26 01:01:56,161 INFO L226 Difference]: Without dead ends: 3462 [2022-11-26 01:01:56,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:56,162 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:56,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2022-11-26 01:01:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3036. [2022-11-26 01:01:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3035 states have (on average 3.85667215815486) internal successors, (11705), 3035 states have internal predecessors, (11705), 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) [2022-11-26 01:01:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 11705 transitions. [2022-11-26 01:01:56,256 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 11705 transitions. Word has length 47 [2022-11-26 01:01:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:56,257 INFO L495 AbstractCegarLoop]: Abstraction has 3036 states and 11705 transitions. [2022-11-26 01:01:56,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 11705 transitions. [2022-11-26 01:01:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 01:01:56,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:56,266 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:56,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-26 01:01:56,267 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2066821411, now seen corresponding path program 3 times [2022-11-26 01:01:56,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:56,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487992143] [2022-11-26 01:01:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:56,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:56,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487992143] [2022-11-26 01:01:56,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487992143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:56,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:56,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412684007] [2022-11-26 01:01:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:56,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:56,964 INFO L87 Difference]: Start difference. First operand 3036 states and 11705 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:57,329 INFO L93 Difference]: Finished difference Result 3574 states and 12917 transitions. [2022-11-26 01:01:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:01:57,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 47 [2022-11-26 01:01:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:57,348 INFO L225 Difference]: With dead ends: 3574 [2022-11-26 01:01:57,348 INFO L226 Difference]: Without dead ends: 3574 [2022-11-26 01:01:57,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:57,349 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:57,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:01:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2022-11-26 01:01:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2278. [2022-11-26 01:01:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 3.7448397013614403) internal successors, (8527), 2277 states have internal predecessors, (8527), 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) [2022-11-26 01:01:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 8527 transitions. [2022-11-26 01:01:57,456 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 8527 transitions. Word has length 47 [2022-11-26 01:01:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:57,456 INFO L495 AbstractCegarLoop]: Abstraction has 2278 states and 8527 transitions. [2022-11-26 01:01:57,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 8527 transitions. [2022-11-26 01:01:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 01:01:57,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:57,467 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:57,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-26 01:01:57,470 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:57,470 INFO L85 PathProgramCache]: Analyzing trace with hash 103265461, now seen corresponding path program 4 times [2022-11-26 01:01:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:57,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889039377] [2022-11-26 01:01:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:57,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 01:01:58,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889039377] [2022-11-26 01:01:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889039377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:58,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:58,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979185838] [2022-11-26 01:01:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:58,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:58,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:58,207 INFO L87 Difference]: Start difference. First operand 2278 states and 8527 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:58,436 INFO L93 Difference]: Finished difference Result 2336 states and 8655 transitions. [2022-11-26 01:01:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:58,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 47 [2022-11-26 01:01:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:58,444 INFO L225 Difference]: With dead ends: 2336 [2022-11-26 01:01:58,445 INFO L226 Difference]: Without dead ends: 2308 [2022-11-26 01:01:58,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:01:58,446 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:58,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:58,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2022-11-26 01:01:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2278. [2022-11-26 01:01:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 3.7325428194993413) internal successors, (8499), 2277 states have internal predecessors, (8499), 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) [2022-11-26 01:01:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 8499 transitions. [2022-11-26 01:01:58,514 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 8499 transitions. Word has length 47 [2022-11-26 01:01:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:58,514 INFO L495 AbstractCegarLoop]: Abstraction has 2278 states and 8499 transitions. [2022-11-26 01:01:58,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 8499 transitions. [2022-11-26 01:01:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 01:01:58,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:58,521 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:58,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-26 01:01:58,522 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:58,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1983351509, now seen corresponding path program 5 times [2022-11-26 01:01:58,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:58,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681461165] [2022-11-26 01:01:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-26 01:01:58,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:58,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681461165] [2022-11-26 01:01:58,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681461165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:58,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:58,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302921914] [2022-11-26 01:01:58,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:58,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:58,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:58,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:58,939 INFO L87 Difference]: Start difference. First operand 2278 states and 8499 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:59,173 INFO L93 Difference]: Finished difference Result 2732 states and 9765 transitions. [2022-11-26 01:01:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:59,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 47 [2022-11-26 01:01:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:59,183 INFO L225 Difference]: With dead ends: 2732 [2022-11-26 01:01:59,184 INFO L226 Difference]: Without dead ends: 2704 [2022-11-26 01:01:59,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:59,185 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:59,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:01:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2022-11-26 01:01:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2280. [2022-11-26 01:01:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2279 states have (on average 3.7305835892935497) internal successors, (8502), 2279 states have internal predecessors, (8502), 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) [2022-11-26 01:01:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 8502 transitions. [2022-11-26 01:01:59,256 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 8502 transitions. Word has length 47 [2022-11-26 01:01:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:01:59,256 INFO L495 AbstractCegarLoop]: Abstraction has 2280 states and 8502 transitions. [2022-11-26 01:01:59,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 8502 transitions. [2022-11-26 01:01:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 01:01:59,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:01:59,263 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:01:59,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-26 01:01:59,264 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:01:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:01:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1692257725, now seen corresponding path program 6 times [2022-11-26 01:01:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:01:59,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513488656] [2022-11-26 01:01:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:01:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:01:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:01:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 01:01:59,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:01:59,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513488656] [2022-11-26 01:01:59,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513488656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:01:59,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:01:59,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:01:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792886683] [2022-11-26 01:01:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:01:59,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:01:59,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:01:59,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:01:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:59,824 INFO L87 Difference]: Start difference. First operand 2280 states and 8502 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:01:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:01:59,962 INFO L93 Difference]: Finished difference Result 2308 states and 8549 transitions. [2022-11-26 01:01:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:01:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 47 [2022-11-26 01:01:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:01:59,968 INFO L225 Difference]: With dead ends: 2308 [2022-11-26 01:01:59,968 INFO L226 Difference]: Without dead ends: 2278 [2022-11-26 01:01:59,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:01:59,969 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:01:59,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:01:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-11-26 01:02:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2278. [2022-11-26 01:02:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 3.7316644707949056) internal successors, (8497), 2277 states have internal predecessors, (8497), 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) [2022-11-26 01:02:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 8497 transitions. [2022-11-26 01:02:00,033 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 8497 transitions. Word has length 47 [2022-11-26 01:02:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:02:00,033 INFO L495 AbstractCegarLoop]: Abstraction has 2278 states and 8497 transitions. [2022-11-26 01:02:00,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-11-26 01:02:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 8497 transitions. [2022-11-26 01:02:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-26 01:02:00,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:02:00,040 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:02:00,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-26 01:02:00,041 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:02:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:02:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -466906492, now seen corresponding path program 1 times [2022-11-26 01:02:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:02:00,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844867412] [2022-11-26 01:02:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:02:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:02:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:02:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:02:05,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:02:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844867412] [2022-11-26 01:02:05,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844867412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:02:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632877404] [2022-11-26 01:02:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:02:05,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:02:05,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:02:05,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:02:05,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:02:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:02:05,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-26 01:02:05,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:02:05,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:02:05,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-11-26 01:02:08,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:02:08,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 321 treesize of output 269 [2022-11-26 01:02:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:02:08,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:02:14,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~ends_with_10~0.offset c_~i_16~0))) (let ((.cse0 (forall ((v_ArrVal_2005 (Array Int Int)) (~ends_with_6~0.base Int) (~ends_with_10~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2005))) (or (= (mod (select (select .cse5 c_~ends_with_2~0.base) c_~ends_with_2~0.offset) 256) 0) (= (mod (select (select .cse5 ~ends_with_10~0.base) .cse2) 256) 0) (= (mod (select (select .cse5 ~ends_with_6~0.base) c_~ends_with_6~0.offset) 256) 0)))))) (and (or .cse0 |c_thread2Thread1of1ForFork0_#t~short27#1|) (or (= (mod c_~break_17~0 256) 0) (forall ((v_ArrVal_2005 (Array Int Int)) (~ends_with_6~0.base Int) (~ends_with_10~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2005))) (or (= (mod (select (select .cse1 c_~ends_with_2~0.base) c_~ends_with_2~0.offset) 256) 0) (not (= (mod (select (select .cse1 ~ends_with_10~0.base) .cse2) 256) 0)) (= (mod (select (select .cse1 ~ends_with_6~0.base) c_~ends_with_6~0.offset) 256) 0))))) (forall ((v_ArrVal_2005 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2005))) (or (forall ((~ends_with_6~0.base Int)) (= (mod (select (select .cse3 ~ends_with_6~0.base) c_~ends_with_6~0.offset) 256) 0)) (= (mod (select (select .cse3 c_~ends_with_2~0.base) c_~ends_with_2~0.offset) 256) 0) (forall ((~ends_with_10~0.base Int)) (let ((.cse4 (select .cse3 ~ends_with_10~0.base))) (or (= (mod (select .cse4 .cse2) 256) 0) (not (= (mod (select .cse4 c_~ends_with_10~0.offset) 256) 0)))))))) (or .cse0 (< c_~i_16~0 4))))) is different from false [2022-11-26 01:02:17,325 INFO L321 Elim1Store]: treesize reduction 33, result has 94.6 percent of original size [2022-11-26 01:02:17,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 391 treesize of output 899 [2022-11-26 01:02:17,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:02:17,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 301 treesize of output 344 [2022-11-26 01:02:17,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:02:17,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 312 [2022-11-26 01:02:17,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:02:17,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 304 [2022-11-26 01:02:18,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:02:18,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 275 treesize of output 296 [2022-11-26 01:05:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:05:10,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632877404] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:05:10,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1645630381] [2022-11-26 01:05:10,739 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:05:10,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:05:10,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 53 [2022-11-26 01:05:10,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411137793] [2022-11-26 01:05:10,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:05:10,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-26 01:05:10,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:05:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-26 01:05:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2566, Unknown=1, NotChecked=104, Total=2970 [2022-11-26 01:05:10,744 INFO L87 Difference]: Start difference. First operand 2278 states and 8497 transitions. Second operand has 55 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 54 states have internal predecessors, (107), 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) [2022-11-26 01:05:27,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:05:29,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:07:02,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:07:16,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:10:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:41,238 INFO L93 Difference]: Finished difference Result 20844 states and 77615 transitions. [2022-11-26 01:10:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 435 states. [2022-11-26 01:10:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 54 states have internal predecessors, (107), 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 49 [2022-11-26 01:10:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:41,297 INFO L225 Difference]: With dead ends: 20844 [2022-11-26 01:10:41,297 INFO L226 Difference]: Without dead ends: 20290 [2022-11-26 01:10:41,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 63 SyntacticMatches, 18 SemanticMatches, 486 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 102006 ImplicationChecksByTransitivity, 267.0s TimeCoverageRelationStatistics Valid=24241, Invalid=212444, Unknown=1, NotChecked=970, Total=237656 [2022-11-26 01:10:41,318 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1502 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29079 mSolverCounterSat, 153 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 29079 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 2284 IncrementalHoareTripleChecker+Unchecked, 64.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:41,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 0 Invalid, 31520 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [153 Valid, 29079 Invalid, 4 Unknown, 2284 Unchecked, 64.6s Time] [2022-11-26 01:10:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20290 states. [2022-11-26 01:10:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20290 to 4120. [2022-11-26 01:10:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 4119 states have (on average 3.853362466618111) internal successors, (15872), 4119 states have internal predecessors, (15872), 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) [2022-11-26 01:10:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 15872 transitions. [2022-11-26 01:10:41,719 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 15872 transitions. Word has length 49 [2022-11-26 01:10:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:41,719 INFO L495 AbstractCegarLoop]: Abstraction has 4120 states and 15872 transitions. [2022-11-26 01:10:41,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 54 states have internal predecessors, (107), 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) [2022-11-26 01:10:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 15872 transitions. [2022-11-26 01:10:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-26 01:10:41,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:41,733 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:41,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:41,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-26 01:10:41,941 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 01:10:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1782896116, now seen corresponding path program 2 times [2022-11-26 01:10:41,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:41,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391261212] [2022-11-26 01:10:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:41,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:10:46,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391261212] [2022-11-26 01:10:46,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391261212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046859622] [2022-11-26 01:10:46,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:10:46,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:46,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:46,388 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:46,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8297c48e-1f40-4cf8-aca2-71f00303206c/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 01:10:46,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 01:10:46,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:10:46,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-26 01:10:46,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:47,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:47,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-11-26 01:10:49,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:10:49,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 74 [2022-11-26 01:10:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:10:49,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:54,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~ends_with_10~0.offset c_~i_16~0)) (.cse1 (= (mod c_~break_17~0 256) 0)) (.cse4 (+ c_~i_16~0 c_~ends_with_2~0.offset))) (let ((.cse0 (and (forall ((v_ArrVal_2114 (Array Int Int)) (~ends_with_6~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2114))) (or (= (mod (select (select .cse7 ~ends_with_6~0.base) c_~ends_with_6~0.offset) 256) 0) (forall ((~ends_with_10~0.base Int)) (= (mod (select (select .cse7 ~ends_with_10~0.base) .cse3) 256) 0)) (= (mod (select (select .cse7 c_~ends_with_2~0.base) .cse4) 256) 0)))) (or .cse1 (forall ((v_ArrVal_2114 (Array Int Int)) (~ends_with_6~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2114))) (or (= (mod (select (select .cse8 ~ends_with_6~0.base) c_~ends_with_6~0.offset) 256) 0) (= (mod (select (select .cse8 c_~ends_with_2~0.base) .cse4) 256) 0)))))))) (and (or .cse0 (< c_~i_16~0 4)) (or .cse1 (forall ((v_ArrVal_2114 (Array Int Int)) (~ends_with_6~0.base Int) (~ends_with_10~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2114))) (or (not (= (mod (select (select .cse2 ~ends_with_10~0.base) .cse3) 256) 0)) (= (mod (select (select .cse2 ~ends_with_6~0.base) c_~ends_with_6~0.offset) 256) 0) (= (mod (select (select .cse2 c_~ends_with_2~0.base) .cse4) 256) 0))))) (or |c_thread2Thread1of1ForFork0_#t~short27#1| .cse0) (forall ((v_ArrVal_2114 (Array Int Int)) (~ends_with_6~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2114))) (or (forall ((~ends_with_10~0.base Int)) (let ((.cse5 (select .cse6 ~ends_with_10~0.base))) (or (not (= (mod (select .cse5 c_~ends_with_10~0.offset) 256) 0)) (= (mod (select .cse5 .cse3) 256) 0)))) (= (mod (select (select .cse6 ~ends_with_6~0.base) c_~ends_with_6~0.offset) 256) 0) (= (mod (select (select .cse6 c_~ends_with_2~0.base) .cse4) 256) 0))))))) is different from false [2022-11-26 01:10:55,511 INFO L321 Elim1Store]: treesize reduction 22, result has 93.0 percent of original size [2022-11-26 01:10:55,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 315 treesize of output 542 [2022-11-26 01:10:55,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:10:55,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 252 [2022-11-26 01:10:55,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:10:55,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 266 [2022-11-26 01:10:55,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:10:55,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 230 [2022-11-26 01:11:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-26 01:11:50,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046859622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:50,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1290238370] [2022-11-26 01:11:50,284 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:11:50,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:11:50,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 53 [2022-11-26 01:11:50,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734947276] [2022-11-26 01:11:50,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:50,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-26 01:11:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:50,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-26 01:11:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2483, Unknown=1, NotChecked=104, Total=2970 [2022-11-26 01:11:50,287 INFO L87 Difference]: Start difference. First operand 4120 states and 15872 transitions. Second operand has 55 states, 54 states have (on average 1.962962962962963) internal successors, (106), 54 states have internal predecessors, (106), 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) [2022-11-26 01:12:05,118 WARN L233 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 179 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:12:20,903 WARN L233 SmtUtils]: Spent 9.96s on a formula simplification. DAG size of input: 192 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:12:37,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:13:22,453 WARN L233 SmtUtils]: Spent 11.75s on a formula simplification. DAG size of input: 186 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:13:33,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]