./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0 --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 6990ac65798f2c5a95ce01b01bd39640075d7bea37e69dff3da0d3d7c4b56ab2 --- 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-e04fb08 [2022-11-16 16:27:54,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 16:27:54,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 16:27:55,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 16:27:55,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 16:27:55,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 16:27:55,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 16:27:55,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 16:27:55,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 16:27:55,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 16:27:55,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 16:27:55,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 16:27:55,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 16:27:55,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 16:27:55,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 16:27:55,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 16:27:55,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 16:27:55,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 16:27:55,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 16:27:55,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 16:27:55,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 16:27:55,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 16:27:55,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 16:27:55,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 16:27:55,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 16:27:55,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 16:27:55,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 16:27:55,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 16:27:55,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 16:27:55,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 16:27:55,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 16:27:55,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 16:27:55,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 16:27:55,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 16:27:55,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 16:27:55,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 16:27:55,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 16:27:55,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 16:27:55,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 16:27:55,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 16:27:55,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 16:27:55,109 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 16:27:55,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 16:27:55,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 16:27:55,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 16:27:55,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 16:27:55,162 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 16:27:55,162 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 16:27:55,162 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 16:27:55,163 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 16:27:55,163 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 16:27:55,163 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 16:27:55,164 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 16:27:55,165 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 16:27:55,165 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 16:27:55,165 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 16:27:55,165 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 16:27:55,166 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 16:27:55,166 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 16:27:55,166 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 16:27:55,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 16:27:55,167 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 16:27:55,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 16:27:55,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 16:27:55,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 16:27:55,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 16:27:55,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 16:27:55,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 16:27:55,169 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 16:27:55,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 16:27:55,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 16:27:55,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 16:27:55,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 16:27:55,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 16:27:55,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:27:55,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 16:27:55,171 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 16:27:55,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 16:27:55,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 16:27:55,172 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 16:27:55,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 16:27:55,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 16:27:55,173 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 16:27:55,173 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_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/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_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0 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 -> 6990ac65798f2c5a95ce01b01bd39640075d7bea37e69dff3da0d3d7c4b56ab2 [2022-11-16 16:27:55,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 16:27:55,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 16:27:55,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 16:27:55,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 16:27:55,537 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 16:27:55,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2022-11-16 16:27:55,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/data/2a901da37/17904a4a6da842aabb604d678b8edfdf/FLAGf812cac68 [2022-11-16 16:27:56,161 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 16:27:56,167 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2022-11-16 16:27:56,180 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/data/2a901da37/17904a4a6da842aabb604d678b8edfdf/FLAGf812cac68 [2022-11-16 16:27:56,486 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/data/2a901da37/17904a4a6da842aabb604d678b8edfdf [2022-11-16 16:27:56,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 16:27:56,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 16:27:56,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 16:27:56,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 16:27:56,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 16:27:56,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:56,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134d39d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56, skipping insertion in model container [2022-11-16 16:27:56,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:56,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 16:27:56,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 16:27:56,850 WARN L229 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_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3412,3425] [2022-11-16 16:27:56,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:27:56,878 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 16:27:56,913 WARN L229 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_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3412,3425] [2022-11-16 16:27:56,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:27:56,945 INFO L208 MainTranslator]: Completed translation [2022-11-16 16:27:56,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56 WrapperNode [2022-11-16 16:27:56,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 16:27:56,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 16:27:56,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 16:27:56,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 16:27:56,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:56,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,031 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-11-16 16:27:57,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 16:27:57,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 16:27:57,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 16:27:57,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 16:27:57,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,068 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 16:27:57,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 16:27:57,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 16:27:57,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 16:27:57,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (1/1) ... [2022-11-16 16:27:57,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:27:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:27:57,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 16:27:57,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 16:27:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 16:27:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 16:27:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 16:27:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 16:27:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 16:27:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 16:27:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 16:27:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 16:27:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 16:27:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 16:27:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 16:27:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 16:27:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 16:27:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 16:27:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 16:27:57,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 16:27:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 16:27:57,177 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 16:27:57,389 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 16:27:57,392 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 16:27:57,968 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 16:27:58,146 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 16:27:58,146 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 16:27:58,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:27:58 BoogieIcfgContainer [2022-11-16 16:27:58,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 16:27:58,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 16:27:58,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 16:27:58,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 16:27:58,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:27:56" (1/3) ... [2022-11-16 16:27:58,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f047e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:27:58, skipping insertion in model container [2022-11-16 16:27:58,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:56" (2/3) ... [2022-11-16 16:27:58,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f047e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:27:58, skipping insertion in model container [2022-11-16 16:27:58,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:27:58" (3/3) ... [2022-11-16 16:27:58,165 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2022-11-16 16:27:58,176 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 16:27:58,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 16:27:58,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 16:27:58,186 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 16:27:58,250 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 16:27:58,318 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 16:27:58,339 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 211 transitions, 446 flow [2022-11-16 16:27:58,348 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 211 transitions, 446 flow [2022-11-16 16:27:58,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 211 transitions, 446 flow [2022-11-16 16:27:58,453 INFO L130 PetriNetUnfolder]: 18/208 cut-off events. [2022-11-16 16:27:58,453 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 16:27:58,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 208 events. 18/208 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 110 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 170. Up to 3 conditions per place. [2022-11-16 16:27:58,461 INFO L119 LiptonReduction]: Number of co-enabled transitions 1456 [2022-11-16 16:28:08,573 INFO L134 LiptonReduction]: Checked pairs total: 2192 [2022-11-16 16:28:08,573 INFO L136 LiptonReduction]: Total number of compositions: 221 [2022-11-16 16:28:08,581 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2022-11-16 16:28:08,612 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 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-16 16:28:08,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 16:28:08,636 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;@1471caa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:28:08,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 16:28:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 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-16 16:28:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 16:28:08,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:08,649 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] [2022-11-16 16:28:08,650 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-16 16:28:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 431725465, now seen corresponding path program 1 times [2022-11-16 16:28:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:08,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20223554] [2022-11-16 16:28:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:08,993 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-16 16:28:08,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:08,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20223554] [2022-11-16 16:28:08,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20223554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:28:08,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:28:08,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:28:08,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430657603] [2022-11-16 16:28:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:28:09,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 16:28:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:09,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 16:28:09,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 16:28:09,032 INFO L87 Difference]: Start difference. First operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 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 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 16:28:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:09,124 INFO L93 Difference]: Finished difference Result 138 states and 428 transitions. [2022-11-16 16:28:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:28:09,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-16 16:28:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:09,144 INFO L225 Difference]: With dead ends: 138 [2022-11-16 16:28:09,144 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 16:28:09,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 16:28:09,150 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:09,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:28:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 16:28:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-16 16:28:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.124087591240876) internal successors, (428), 137 states have internal predecessors, (428), 0 states have call successors, (0), 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-16 16:28:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 428 transitions. [2022-11-16 16:28:09,214 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 428 transitions. Word has length 21 [2022-11-16 16:28:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:09,216 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 428 transitions. [2022-11-16 16:28:09,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 16:28:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 428 transitions. [2022-11-16 16:28:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 16:28:09,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:09,223 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-16 16:28:09,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 16:28:09,223 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-16 16:28:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1587311604, now seen corresponding path program 1 times [2022-11-16 16:28:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:09,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738413003] [2022-11-16 16:28:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:09,584 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-16 16:28:09,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:09,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738413003] [2022-11-16 16:28:09,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738413003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:28:09,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:28:09,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:28:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023437337] [2022-11-16 16:28:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:28:09,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:28:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:28:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:28:09,588 INFO L87 Difference]: Start difference. First operand 138 states and 428 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-16 16:28:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:09,680 INFO L93 Difference]: Finished difference Result 177 states and 515 transitions. [2022-11-16 16:28:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:28:09,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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 22 [2022-11-16 16:28:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:09,683 INFO L225 Difference]: With dead ends: 177 [2022-11-16 16:28:09,683 INFO L226 Difference]: Without dead ends: 139 [2022-11-16 16:28:09,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:28:09,685 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:09,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:28:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-16 16:28:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-16 16:28:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.108695652173913) internal successors, (429), 138 states have internal predecessors, (429), 0 states have call successors, (0), 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-16 16:28:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 429 transitions. [2022-11-16 16:28:09,699 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 429 transitions. Word has length 22 [2022-11-16 16:28:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:09,699 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 429 transitions. [2022-11-16 16:28:09,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-16 16:28:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 429 transitions. [2022-11-16 16:28:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 16:28:09,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:09,701 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, 1] [2022-11-16 16:28:09,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 16:28:09,702 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-16 16:28:09,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1309358947, now seen corresponding path program 1 times [2022-11-16 16:28:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:09,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828929658] [2022-11-16 16:28:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:09,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828929658] [2022-11-16 16:28:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828929658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:28:09,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:28:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:28:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689878967] [2022-11-16 16:28:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:28:09,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:28:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:28:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:28:09,914 INFO L87 Difference]: Start difference. First operand 139 states and 429 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-16 16:28:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:10,023 INFO L93 Difference]: Finished difference Result 213 states and 614 transitions. [2022-11-16 16:28:10,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:28:10,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 23 [2022-11-16 16:28:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:10,026 INFO L225 Difference]: With dead ends: 213 [2022-11-16 16:28:10,026 INFO L226 Difference]: Without dead ends: 140 [2022-11-16 16:28:10,026 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-16 16:28:10,028 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:10,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:28:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-16 16:28:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-11-16 16:28:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.093525179856115) internal successors, (430), 139 states have internal predecessors, (430), 0 states have call successors, (0), 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-16 16:28:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 430 transitions. [2022-11-16 16:28:10,038 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 430 transitions. Word has length 23 [2022-11-16 16:28:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:10,039 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 430 transitions. [2022-11-16 16:28:10,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-16 16:28:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 430 transitions. [2022-11-16 16:28:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 16:28:10,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:10,041 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, 1, 1] [2022-11-16 16:28:10,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 16:28:10,041 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-16 16:28:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1495154295, now seen corresponding path program 1 times [2022-11-16 16:28:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:10,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502924131] [2022-11-16 16:28:10,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 16:28:10,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:10,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502924131] [2022-11-16 16:28:10,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502924131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:28:10,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:28:10,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:28:10,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767368707] [2022-11-16 16:28:10,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:28:10,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:28:10,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:10,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:28:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:28:10,218 INFO L87 Difference]: Start difference. First operand 140 states and 430 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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-16 16:28:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:10,282 INFO L93 Difference]: Finished difference Result 142 states and 436 transitions. [2022-11-16 16:28:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:28:10,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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 24 [2022-11-16 16:28:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:10,284 INFO L225 Difference]: With dead ends: 142 [2022-11-16 16:28:10,284 INFO L226 Difference]: Without dead ends: 142 [2022-11-16 16:28:10,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:28:10,286 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:10,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:28:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-16 16:28:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-11-16 16:28:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 3.0921985815602837) internal successors, (436), 141 states have internal predecessors, (436), 0 states have call successors, (0), 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-16 16:28:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 436 transitions. [2022-11-16 16:28:10,297 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 436 transitions. Word has length 24 [2022-11-16 16:28:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:10,298 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 436 transitions. [2022-11-16 16:28:10,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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-16 16:28:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 436 transitions. [2022-11-16 16:28:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 16:28:10,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:10,300 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, 1, 1] [2022-11-16 16:28:10,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 16:28:10,301 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-16 16:28:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 118177911, now seen corresponding path program 2 times [2022-11-16 16:28:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:10,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102922799] [2022-11-16 16:28:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 16:28:10,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:10,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102922799] [2022-11-16 16:28:10,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102922799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:28:10,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:28:10,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 16:28:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473031445] [2022-11-16 16:28:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:28:10,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 16:28:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:10,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 16:28:10,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 16:28:10,876 INFO L87 Difference]: Start difference. First operand 142 states and 436 transitions. Second operand has 7 states, 6 states have (on average 4.0) 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-16 16:28:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:11,027 INFO L93 Difference]: Finished difference Result 277 states and 825 transitions. [2022-11-16 16:28:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 16:28:11,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) 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 24 [2022-11-16 16:28:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:11,030 INFO L225 Difference]: With dead ends: 277 [2022-11-16 16:28:11,030 INFO L226 Difference]: Without dead ends: 258 [2022-11-16 16:28:11,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-16 16:28:11,031 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 92 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:11,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 16 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:28:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-16 16:28:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2022-11-16 16:28:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.9655172413793105) internal successors, (602), 203 states have internal predecessors, (602), 0 states have call successors, (0), 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-16 16:28:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 602 transitions. [2022-11-16 16:28:11,044 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 602 transitions. Word has length 24 [2022-11-16 16:28:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:11,044 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 602 transitions. [2022-11-16 16:28:11,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) 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-16 16:28:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 602 transitions. [2022-11-16 16:28:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 16:28:11,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:11,047 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, 1, 1, 1] [2022-11-16 16:28:11,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 16:28:11,047 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-16 16:28:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1946809447, now seen corresponding path program 1 times [2022-11-16 16:28:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:11,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426251795] [2022-11-16 16:28:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 16:28:11,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:11,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426251795] [2022-11-16 16:28:11,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426251795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:28:11,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:28:11,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:28:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511068740] [2022-11-16 16:28:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:28:11,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:28:11,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:11,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:28:11,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:28:11,302 INFO L87 Difference]: Start difference. First operand 204 states and 602 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-16 16:28:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:11,390 INFO L93 Difference]: Finished difference Result 364 states and 1018 transitions. [2022-11-16 16:28:11,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:28:11,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 16:28:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:11,393 INFO L225 Difference]: With dead ends: 364 [2022-11-16 16:28:11,393 INFO L226 Difference]: Without dead ends: 342 [2022-11-16 16:28:11,393 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-16 16:28:11,394 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:11,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 5 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:28:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-16 16:28:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 298. [2022-11-16 16:28:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.942760942760943) internal successors, (874), 297 states have internal predecessors, (874), 0 states have call successors, (0), 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-16 16:28:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 874 transitions. [2022-11-16 16:28:11,409 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 874 transitions. Word has length 25 [2022-11-16 16:28:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:11,409 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 874 transitions. [2022-11-16 16:28:11,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-16 16:28:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 874 transitions. [2022-11-16 16:28:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 16:28:11,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:11,411 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, 1, 1, 1] [2022-11-16 16:28:11,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 16:28:11,412 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-16 16:28:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash 971772140, now seen corresponding path program 1 times [2022-11-16 16:28:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:11,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088721001] [2022-11-16 16:28:11,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:11,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:11,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088721001] [2022-11-16 16:28:11,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088721001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030676364] [2022-11-16 16:28:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:11,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:11,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:11,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:11,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 16:28:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:11,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 16:28:11,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:11,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030676364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1250695548] [2022-11-16 16:28:12,094 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:336) 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-16 16:28:12,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:12,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-16 16:28:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140583461] [2022-11-16 16:28:12,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:12,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 16:28:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 16:28:12,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-16 16:28:12,113 INFO L87 Difference]: Start difference. First operand 298 states and 874 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 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-16 16:28:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:12,334 INFO L93 Difference]: Finished difference Result 530 states and 1464 transitions. [2022-11-16 16:28:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 16:28:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 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 25 [2022-11-16 16:28:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:12,339 INFO L225 Difference]: With dead ends: 530 [2022-11-16 16:28:12,339 INFO L226 Difference]: Without dead ends: 468 [2022-11-16 16:28:12,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-16 16:28:12,340 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:12,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 32 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 16:28:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-16 16:28:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 330. [2022-11-16 16:28:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.8814589665653494) internal successors, (948), 329 states have internal predecessors, (948), 0 states have call successors, (0), 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-16 16:28:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 948 transitions. [2022-11-16 16:28:12,357 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 948 transitions. Word has length 25 [2022-11-16 16:28:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:12,359 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 948 transitions. [2022-11-16 16:28:12,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 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-16 16:28:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 948 transitions. [2022-11-16 16:28:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 16:28:12,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:12,363 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:12,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:12,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:12,569 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-16 16:28:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:12,570 INFO L85 PathProgramCache]: Analyzing trace with hash 742298531, now seen corresponding path program 2 times [2022-11-16 16:28:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:12,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002548251] [2022-11-16 16:28:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:13,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:13,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002548251] [2022-11-16 16:28:13,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002548251] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:13,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526829208] [2022-11-16 16:28:13,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 16:28:13,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:13,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:13,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:13,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 16:28:14,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 16:28:14,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:28:14,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 16:28:14,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:14,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-16 16:28:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:14,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:14,507 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 16:28:14,508 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 25 treesize of output 16 [2022-11-16 16:28:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:14,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526829208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:14,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1754867045] [2022-11-16 16:28:14,803 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:336) 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-16 16:28:14,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:14,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-11-16 16:28:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377762065] [2022-11-16 16:28:14,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:14,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 16:28:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 16:28:14,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-11-16 16:28:14,811 INFO L87 Difference]: Start difference. First operand 330 states and 948 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 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-16 16:28:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:17,461 INFO L93 Difference]: Finished difference Result 1437 states and 4142 transitions. [2022-11-16 16:28:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:28:17,461 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 16:28:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:17,469 INFO L225 Difference]: With dead ends: 1437 [2022-11-16 16:28:17,470 INFO L226 Difference]: Without dead ends: 1290 [2022-11-16 16:28:17,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2022-11-16 16:28:17,473 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 371 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:17,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 176 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 16:28:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-16 16:28:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 548. [2022-11-16 16:28:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 3.2559414990859232) internal successors, (1781), 547 states have internal predecessors, (1781), 0 states have call successors, (0), 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-16 16:28:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1781 transitions. [2022-11-16 16:28:17,506 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1781 transitions. Word has length 26 [2022-11-16 16:28:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:17,507 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 1781 transitions. [2022-11-16 16:28:17,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 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-16 16:28:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1781 transitions. [2022-11-16 16:28:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 16:28:17,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:17,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:17,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:17,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:17,716 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-16 16:28:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1663260073, now seen corresponding path program 3 times [2022-11-16 16:28:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:17,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821410339] [2022-11-16 16:28:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:18,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:18,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821410339] [2022-11-16 16:28:18,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821410339] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:18,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569594218] [2022-11-16 16:28:18,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 16:28:18,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:18,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:18,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:18,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 16:28:18,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 16:28:18,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:28:18,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 16:28:18,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:19,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:28:19,090 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 18 treesize of output 20 [2022-11-16 16:28:19,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-16 16:28:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:19,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:19,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:28:19,376 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 45 treesize of output 41 [2022-11-16 16:28:19,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-16 16:28:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:19,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569594218] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:19,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1687437740] [2022-11-16 16:28:19,759 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:336) 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-16 16:28:19,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:19,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 24 [2022-11-16 16:28:19,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044957118] [2022-11-16 16:28:19,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:19,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 16:28:19,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 16:28:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=489, Unknown=2, NotChecked=0, Total=600 [2022-11-16 16:28:19,762 INFO L87 Difference]: Start difference. First operand 548 states and 1781 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 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-16 16:28:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:22,745 INFO L93 Difference]: Finished difference Result 1851 states and 5937 transitions. [2022-11-16 16:28:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 16:28:22,746 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 16:28:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:22,759 INFO L225 Difference]: With dead ends: 1851 [2022-11-16 16:28:22,759 INFO L226 Difference]: Without dead ends: 1851 [2022-11-16 16:28:22,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=472, Invalid=1975, Unknown=3, NotChecked=0, Total=2450 [2022-11-16 16:28:22,761 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 375 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:22,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 138 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1073 Invalid, 0 Unknown, 115 Unchecked, 1.2s Time] [2022-11-16 16:28:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2022-11-16 16:28:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 727. [2022-11-16 16:28:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 3.458677685950413) internal successors, (2511), 726 states have internal predecessors, (2511), 0 states have call successors, (0), 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-16 16:28:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2511 transitions. [2022-11-16 16:28:22,811 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2511 transitions. Word has length 26 [2022-11-16 16:28:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:22,812 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 2511 transitions. [2022-11-16 16:28:22,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 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-16 16:28:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2511 transitions. [2022-11-16 16:28:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 16:28:22,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:22,815 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:22,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:23,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:23,022 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-16 16:28:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash -512302225, now seen corresponding path program 4 times [2022-11-16 16:28:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:23,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053089917] [2022-11-16 16:28:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:28:24,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:24,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053089917] [2022-11-16 16:28:24,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053089917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:24,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438657552] [2022-11-16 16:28:24,654 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 16:28:24,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:24,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:24,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:24,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 16:28:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:24,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 16:28:24,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:25,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:28:25,165 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 18 treesize of output 20 [2022-11-16 16:28:25,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:28:25,251 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 18 treesize of output 20 [2022-11-16 16:28:25,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-16 16:28:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:25,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:25,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:28:25,745 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 167 treesize of output 155 [2022-11-16 16:28:25,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2022-11-16 16:28:25,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 102 [2022-11-16 16:28:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:26,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438657552] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:26,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860839010] [2022-11-16 16:28:26,197 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:336) 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-16 16:28:26,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:26,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 28 [2022-11-16 16:28:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739081582] [2022-11-16 16:28:26,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:26,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 16:28:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:26,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 16:28:26,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=685, Unknown=2, NotChecked=0, Total=812 [2022-11-16 16:28:26,199 INFO L87 Difference]: Start difference. First operand 727 states and 2511 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 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-16 16:28:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:31,098 INFO L93 Difference]: Finished difference Result 2224 states and 7152 transitions. [2022-11-16 16:28:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-16 16:28:31,099 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 16:28:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:31,113 INFO L225 Difference]: With dead ends: 2224 [2022-11-16 16:28:31,113 INFO L226 Difference]: Without dead ends: 2224 [2022-11-16 16:28:31,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=584, Invalid=2834, Unknown=4, NotChecked=0, Total=3422 [2022-11-16 16:28:31,116 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 554 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:31,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 157 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1280 Invalid, 0 Unknown, 113 Unchecked, 1.5s Time] [2022-11-16 16:28:31,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2022-11-16 16:28:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 768. [2022-11-16 16:28:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 3.441981747066493) internal successors, (2640), 767 states have internal predecessors, (2640), 0 states have call successors, (0), 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-16 16:28:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 2640 transitions. [2022-11-16 16:28:31,169 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 2640 transitions. Word has length 26 [2022-11-16 16:28:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:31,170 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 2640 transitions. [2022-11-16 16:28:31,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 0 states have call successors, (0), 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-16 16:28:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 2640 transitions. [2022-11-16 16:28:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 16:28:31,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:31,175 INFO L195 NwaCegarLoop]: trace histogram [3, 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-16 16:28:31,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:31,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 16:28:31,381 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-16 16:28:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1922578298, now seen corresponding path program 5 times [2022-11-16 16:28:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:31,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177358842] [2022-11-16 16:28:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:32,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:32,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177358842] [2022-11-16 16:28:32,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177358842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:32,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224302878] [2022-11-16 16:28:32,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 16:28:32,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:32,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:32,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:32,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 16:28:32,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 16:28:32,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:28:32,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 16:28:32,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:32,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-16 16:28:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 16:28:32,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:32,918 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 16:28:32,918 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 25 treesize of output 16 [2022-11-16 16:28:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 16:28:32,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224302878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [338915272] [2022-11-16 16:28:32,958 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:336) 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-16 16:28:32,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:32,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2022-11-16 16:28:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483290804] [2022-11-16 16:28:32,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:32,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 16:28:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:32,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 16:28:32,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-16 16:28:32,961 INFO L87 Difference]: Start difference. First operand 768 states and 2640 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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-16 16:28:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:33,572 INFO L93 Difference]: Finished difference Result 1005 states and 3306 transitions. [2022-11-16 16:28:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 16:28:33,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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 27 [2022-11-16 16:28:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:33,580 INFO L225 Difference]: With dead ends: 1005 [2022-11-16 16:28:33,580 INFO L226 Difference]: Without dead ends: 1005 [2022-11-16 16:28:33,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-11-16 16:28:33,581 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 65 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:33,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 48 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 16:28:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2022-11-16 16:28:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 793. [2022-11-16 16:28:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 3.448232323232323) internal successors, (2731), 792 states have internal predecessors, (2731), 0 states have call successors, (0), 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-16 16:28:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2731 transitions. [2022-11-16 16:28:33,611 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 2731 transitions. Word has length 27 [2022-11-16 16:28:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:33,614 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 2731 transitions. [2022-11-16 16:28:33,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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-16 16:28:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 2731 transitions. [2022-11-16 16:28:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 16:28:33,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:33,617 INFO L195 NwaCegarLoop]: trace histogram [3, 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-16 16:28:33,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:33,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:33,824 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-16 16:28:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash -207420774, now seen corresponding path program 6 times [2022-11-16 16:28:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:33,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405433200] [2022-11-16 16:28:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:28:36,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:36,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405433200] [2022-11-16 16:28:36,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405433200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:36,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679726479] [2022-11-16 16:28:36,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 16:28:36,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:36,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:36,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:36,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 16:28:36,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 16:28:36,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:28:36,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 16:28:36,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:28:36,423 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 18 treesize of output 20 [2022-11-16 16:28:36,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-16 16:28:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 16:28:36,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:36,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-11-16 16:28:36,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:28:36,585 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 45 treesize of output 41 [2022-11-16 16:28:36,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-16 16:28:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 16:28:36,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679726479] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:36,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [618089871] [2022-11-16 16:28:36,738 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:336) 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-16 16:28:36,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:36,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 6] total 24 [2022-11-16 16:28:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787441805] [2022-11-16 16:28:36,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:36,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 16:28:36,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:36,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 16:28:36,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=492, Unknown=1, NotChecked=44, Total=600 [2022-11-16 16:28:36,743 INFO L87 Difference]: Start difference. First operand 793 states and 2731 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 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-16 16:28:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:38,181 INFO L93 Difference]: Finished difference Result 1229 states and 4064 transitions. [2022-11-16 16:28:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 16:28:38,182 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 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 27 [2022-11-16 16:28:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:38,189 INFO L225 Difference]: With dead ends: 1229 [2022-11-16 16:28:38,189 INFO L226 Difference]: Without dead ends: 1229 [2022-11-16 16:28:38,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=146, Invalid=979, Unknown=1, NotChecked=64, Total=1190 [2022-11-16 16:28:38,191 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 143 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:38,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 76 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 648 Invalid, 0 Unknown, 68 Unchecked, 0.7s Time] [2022-11-16 16:28:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2022-11-16 16:28:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 791. [2022-11-16 16:28:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 3.4658227848101264) internal successors, (2738), 790 states have internal predecessors, (2738), 0 states have call successors, (0), 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-16 16:28:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 2738 transitions. [2022-11-16 16:28:38,220 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 2738 transitions. Word has length 27 [2022-11-16 16:28:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:38,221 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 2738 transitions. [2022-11-16 16:28:38,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 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-16 16:28:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 2738 transitions. [2022-11-16 16:28:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 16:28:38,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:38,224 INFO L195 NwaCegarLoop]: trace histogram [3, 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-16 16:28:38,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:38,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:38,430 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-16 16:28:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash 943537074, now seen corresponding path program 7 times [2022-11-16 16:28:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:38,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563848189] [2022-11-16 16:28:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:28:39,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:39,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563848189] [2022-11-16 16:28:39,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563848189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:39,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486383150] [2022-11-16 16:28:39,970 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 16:28:39,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:39,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:39,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:39,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 16:28:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:40,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 16:28:40,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:40,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:28:40,356 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 18 treesize of output 20 [2022-11-16 16:28:40,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:28:40,407 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 18 treesize of output 20 [2022-11-16 16:28:40,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-16 16:28:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 16:28:40,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:40,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_552) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-11-16 16:28:40,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:28:40,592 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 167 treesize of output 155 [2022-11-16 16:28:40,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2022-11-16 16:28:40,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 102 [2022-11-16 16:28:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 16:28:40,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486383150] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:40,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [343830304] [2022-11-16 16:28:40,763 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:336) 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-16 16:28:40,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:40,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 24 [2022-11-16 16:28:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297442653] [2022-11-16 16:28:40,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:40,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 16:28:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:40,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 16:28:40,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=478, Unknown=8, NotChecked=44, Total=600 [2022-11-16 16:28:40,767 INFO L87 Difference]: Start difference. First operand 791 states and 2738 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 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-16 16:28:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:42,243 INFO L93 Difference]: Finished difference Result 1053 states and 3502 transitions. [2022-11-16 16:28:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 16:28:42,244 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 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 27 [2022-11-16 16:28:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:42,250 INFO L225 Difference]: With dead ends: 1053 [2022-11-16 16:28:42,250 INFO L226 Difference]: Without dead ends: 1053 [2022-11-16 16:28:42,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=959, Unknown=8, NotChecked=64, Total=1190 [2022-11-16 16:28:42,252 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 182 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:42,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 101 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 716 Invalid, 0 Unknown, 106 Unchecked, 0.7s Time] [2022-11-16 16:28:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2022-11-16 16:28:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 666. [2022-11-16 16:28:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 3.4917293233082707) internal successors, (2322), 665 states have internal predecessors, (2322), 0 states have call successors, (0), 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-16 16:28:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 2322 transitions. [2022-11-16 16:28:42,281 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 2322 transitions. Word has length 27 [2022-11-16 16:28:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:42,281 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 2322 transitions. [2022-11-16 16:28:42,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 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-16 16:28:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 2322 transitions. [2022-11-16 16:28:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 16:28:42,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:42,286 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:42,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:42,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 16:28:42,493 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-16 16:28:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash -164617628, now seen corresponding path program 1 times [2022-11-16 16:28:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:42,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72413975] [2022-11-16 16:28:42,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:42,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 16:28:42,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72413975] [2022-11-16 16:28:42,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72413975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:42,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815835844] [2022-11-16 16:28:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:42,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:42,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:42,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:42,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 16:28:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:42,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 16:28:42,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 16:28:42,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 16:28:43,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815835844] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:43,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [578508175] [2022-11-16 16:28:43,005 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:336) 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-16 16:28:43,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:43,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-16 16:28:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596827469] [2022-11-16 16:28:43,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:43,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 16:28:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:43,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 16:28:43,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-16 16:28:43,008 INFO L87 Difference]: Start difference. First operand 666 states and 2322 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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-16 16:28:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:43,161 INFO L93 Difference]: Finished difference Result 1103 states and 3561 transitions. [2022-11-16 16:28:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 16:28:43,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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 27 [2022-11-16 16:28:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:43,166 INFO L225 Difference]: With dead ends: 1103 [2022-11-16 16:28:43,166 INFO L226 Difference]: Without dead ends: 669 [2022-11-16 16:28:43,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-16 16:28:43,167 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:43,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 21 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:28:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-16 16:28:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-11-16 16:28:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 3.480538922155689) internal successors, (2325), 668 states have internal predecessors, (2325), 0 states have call successors, (0), 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-16 16:28:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 2325 transitions. [2022-11-16 16:28:43,189 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 2325 transitions. Word has length 27 [2022-11-16 16:28:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:43,189 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 2325 transitions. [2022-11-16 16:28:43,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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-16 16:28:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 2325 transitions. [2022-11-16 16:28:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 16:28:43,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:43,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:43,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:43,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:43,399 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-16 16:28:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1779097794, now seen corresponding path program 2 times [2022-11-16 16:28:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:43,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664610163] [2022-11-16 16:28:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 16:28:43,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:43,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664610163] [2022-11-16 16:28:43,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664610163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:28:43,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:28:43,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:28:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947603408] [2022-11-16 16:28:43,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:28:43,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:28:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:43,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:28:43,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:28:43,589 INFO L87 Difference]: Start difference. First operand 669 states and 2325 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 16:28:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:43,674 INFO L93 Difference]: Finished difference Result 953 states and 3130 transitions. [2022-11-16 16:28:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:28:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 28 [2022-11-16 16:28:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:43,680 INFO L225 Difference]: With dead ends: 953 [2022-11-16 16:28:43,681 INFO L226 Difference]: Without dead ends: 857 [2022-11-16 16:28:43,682 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-16 16:28:43,684 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:43,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 7 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:28:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-11-16 16:28:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 761. [2022-11-16 16:28:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 760 states have (on average 3.5092105263157896) internal successors, (2667), 760 states have internal predecessors, (2667), 0 states have call successors, (0), 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-16 16:28:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 2667 transitions. [2022-11-16 16:28:43,710 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 2667 transitions. Word has length 28 [2022-11-16 16:28:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:43,711 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 2667 transitions. [2022-11-16 16:28:43,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-16 16:28:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 2667 transitions. [2022-11-16 16:28:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 16:28:43,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:43,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:43,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 16:28:43,715 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-16 16:28:43,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash 877563102, now seen corresponding path program 1 times [2022-11-16 16:28:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:43,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730749543] [2022-11-16 16:28:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:28:44,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:44,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730749543] [2022-11-16 16:28:44,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730749543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:44,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085642211] [2022-11-16 16:28:44,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:44,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:44,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:44,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:44,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 16:28:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:44,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 16:28:44,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:28:45,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:45,183 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 16:28:45,183 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 24 treesize of output 15 [2022-11-16 16:28:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:28:45,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085642211] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:45,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1006104835] [2022-11-16 16:28:45,458 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:336) 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-16 16:28:45,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:45,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-16 16:28:45,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571319428] [2022-11-16 16:28:45,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:45,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 16:28:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 16:28:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-11-16 16:28:45,461 INFO L87 Difference]: Start difference. First operand 761 states and 2667 transitions. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 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-16 16:28:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:46,304 INFO L93 Difference]: Finished difference Result 2119 states and 6991 transitions. [2022-11-16 16:28:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 16:28:46,305 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 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 29 [2022-11-16 16:28:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:46,320 INFO L225 Difference]: With dead ends: 2119 [2022-11-16 16:28:46,320 INFO L226 Difference]: Without dead ends: 2119 [2022-11-16 16:28:46,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 16:28:46,321 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 180 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:46,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 53 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 318 Invalid, 0 Unknown, 17 Unchecked, 0.3s Time] [2022-11-16 16:28:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-11-16 16:28:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1427. [2022-11-16 16:28:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 3.5897615708274895) internal successors, (5119), 1426 states have internal predecessors, (5119), 0 states have call successors, (0), 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-16 16:28:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 5119 transitions. [2022-11-16 16:28:46,394 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 5119 transitions. Word has length 29 [2022-11-16 16:28:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:46,395 INFO L495 AbstractCegarLoop]: Abstraction has 1427 states and 5119 transitions. [2022-11-16 16:28:46,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 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-16 16:28:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 5119 transitions. [2022-11-16 16:28:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 16:28:46,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:46,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:46,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:46,608 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-16 16:28:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 5011714, now seen corresponding path program 2 times [2022-11-16 16:28:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537414678] [2022-11-16 16:28:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:28:47,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:47,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537414678] [2022-11-16 16:28:47,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537414678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:47,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938021666] [2022-11-16 16:28:47,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 16:28:47,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:47,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:47,389 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:47,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 16:28:47,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 16:28:47,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:28:47,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 16:28:47,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:28:48,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:48,819 INFO L321 Elim1Store]: treesize reduction 23, result has 77.2 percent of original size [2022-11-16 16:28:48,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 90 [2022-11-16 16:28:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:28:49,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938021666] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:49,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1467353759] [2022-11-16 16:28:49,581 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:336) 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-16 16:28:49,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:49,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 32 [2022-11-16 16:28:49,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886065277] [2022-11-16 16:28:49,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:49,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 16:28:49,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:49,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 16:28:49,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 16:28:49,583 INFO L87 Difference]: Start difference. First operand 1427 states and 5119 transitions. Second operand has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 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-16 16:28:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:53,129 INFO L93 Difference]: Finished difference Result 2807 states and 9289 transitions. [2022-11-16 16:28:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-16 16:28:53,130 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 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 29 [2022-11-16 16:28:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:53,146 INFO L225 Difference]: With dead ends: 2807 [2022-11-16 16:28:53,146 INFO L226 Difference]: Without dead ends: 2807 [2022-11-16 16:28:53,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=798, Invalid=4172, Unknown=0, NotChecked=0, Total=4970 [2022-11-16 16:28:53,148 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 559 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:53,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 168 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 667 Invalid, 0 Unknown, 715 Unchecked, 0.7s Time] [2022-11-16 16:28:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-11-16 16:28:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 1750. [2022-11-16 16:28:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 3.6437964551172097) internal successors, (6373), 1749 states have internal predecessors, (6373), 0 states have call successors, (0), 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-16 16:28:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 6373 transitions. [2022-11-16 16:28:53,226 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 6373 transitions. Word has length 29 [2022-11-16 16:28:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:53,227 INFO L495 AbstractCegarLoop]: Abstraction has 1750 states and 6373 transitions. [2022-11-16 16:28:53,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 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-16 16:28:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 6373 transitions. [2022-11-16 16:28:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 16:28:53,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:53,234 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:53,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 16:28:53,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 16:28:53,440 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-16 16:28:53,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2128139744, now seen corresponding path program 3 times [2022-11-16 16:28:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:53,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588225152] [2022-11-16 16:28:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 16:28:54,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:54,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588225152] [2022-11-16 16:28:54,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588225152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:54,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461288908] [2022-11-16 16:28:54,157 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 16:28:54,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:54,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:54,160 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:54,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 16:28:54,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 16:28:54,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:28:54,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 16:28:54,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:28:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:28:54,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:28:55,172 INFO L321 Elim1Store]: treesize reduction 23, result has 77.2 percent of original size [2022-11-16 16:28:55,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 90 [2022-11-16 16:28:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:28:55,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461288908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:28:55,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1649626929] [2022-11-16 16:28:55,640 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:336) 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-16 16:28:55,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:28:55,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-11-16 16:28:55,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692909982] [2022-11-16 16:28:55,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:28:55,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 16:28:55,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:28:55,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 16:28:55,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2022-11-16 16:28:55,646 INFO L87 Difference]: Start difference. First operand 1750 states and 6373 transitions. Second operand has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 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-16 16:28:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:28:58,524 INFO L93 Difference]: Finished difference Result 3493 states and 12425 transitions. [2022-11-16 16:28:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-16 16:28:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 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 29 [2022-11-16 16:28:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:28:58,541 INFO L225 Difference]: With dead ends: 3493 [2022-11-16 16:28:58,541 INFO L226 Difference]: Without dead ends: 3493 [2022-11-16 16:28:58,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=515, Invalid=3145, Unknown=0, NotChecked=0, Total=3660 [2022-11-16 16:28:58,542 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 358 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 666 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 16:28:58,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 112 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 497 Invalid, 0 Unknown, 666 Unchecked, 0.5s Time] [2022-11-16 16:28:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3493 states. [2022-11-16 16:28:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3493 to 2258. [2022-11-16 16:28:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 3.7864421798848027) internal successors, (8546), 2257 states have internal predecessors, (8546), 0 states have call successors, (0), 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-16 16:28:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 8546 transitions. [2022-11-16 16:28:58,624 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 8546 transitions. Word has length 29 [2022-11-16 16:28:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:28:58,625 INFO L495 AbstractCegarLoop]: Abstraction has 2258 states and 8546 transitions. [2022-11-16 16:28:58,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 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-16 16:28:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 8546 transitions. [2022-11-16 16:28:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 16:28:58,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:28:58,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:28:58,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-16 16:28:58,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 16:28:58,839 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-16 16:28:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:28:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash -429921444, now seen corresponding path program 4 times [2022-11-16 16:28:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:28:58,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794540345] [2022-11-16 16:28:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:28:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:28:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:28:59,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:28:59,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794540345] [2022-11-16 16:28:59,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794540345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:28:59,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787164819] [2022-11-16 16:28:59,437 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 16:28:59,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:28:59,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:28:59,440 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:28:59,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 16:28:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:28:59,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 16:28:59,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:29:00,065 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-16 16:29:00,066 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 44 treesize of output 10 [2022-11-16 16:29:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:29:00,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:29:00,322 INFO L321 Elim1Store]: treesize reduction 23, result has 77.2 percent of original size [2022-11-16 16:29:00,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 90 [2022-11-16 16:29:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:00,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787164819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:29:00,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1494231123] [2022-11-16 16:29:00,698 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:336) 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-16 16:29:00,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:29:00,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-11-16 16:29:00,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710549711] [2022-11-16 16:29:00,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:29:00,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 16:29:00,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:29:00,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 16:29:00,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-11-16 16:29:00,703 INFO L87 Difference]: Start difference. First operand 2258 states and 8546 transitions. Second operand has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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-16 16:29:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:29:02,228 INFO L93 Difference]: Finished difference Result 3573 states and 13174 transitions. [2022-11-16 16:29:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 16:29:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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 29 [2022-11-16 16:29:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:29:02,243 INFO L225 Difference]: With dead ends: 3573 [2022-11-16 16:29:02,244 INFO L226 Difference]: Without dead ends: 3571 [2022-11-16 16:29:02,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=390, Invalid=2060, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 16:29:02,245 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 343 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 16:29:02,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 83 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 343 Invalid, 0 Unknown, 293 Unchecked, 0.3s Time] [2022-11-16 16:29:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-11-16 16:29:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2908. [2022-11-16 16:29:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2907 states have (on average 3.8197454420364636) internal successors, (11104), 2907 states have internal predecessors, (11104), 0 states have call successors, (0), 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-16 16:29:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 11104 transitions. [2022-11-16 16:29:02,346 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 11104 transitions. Word has length 29 [2022-11-16 16:29:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:29:02,346 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 11104 transitions. [2022-11-16 16:29:02,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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-16 16:29:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 11104 transitions. [2022-11-16 16:29:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 16:29:02,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:29:02,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:29:02,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 16:29:02,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:02,561 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-16 16:29:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:29:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -563100560, now seen corresponding path program 5 times [2022-11-16 16:29:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:29:02,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877666531] [2022-11-16 16:29:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:29:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:29:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:29:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:03,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:29:03,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877666531] [2022-11-16 16:29:03,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877666531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:29:03,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92907636] [2022-11-16 16:29:03,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 16:29:03,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:03,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:29:03,221 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:29:03,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 16:29:03,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 16:29:03,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:29:03,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 16:29:03,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:29:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:03,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:29:04,008 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 16:29:04,009 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 24 treesize of output 15 [2022-11-16 16:29:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:04,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92907636] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:29:04,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [152896114] [2022-11-16 16:29:04,382 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:336) 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-16 16:29:04,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:29:04,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-11-16 16:29:04,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608573194] [2022-11-16 16:29:04,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:29:04,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 16:29:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:29:04,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 16:29:04,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2022-11-16 16:29:04,384 INFO L87 Difference]: Start difference. First operand 2908 states and 11104 transitions. Second operand has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 22 states have internal predecessors, (78), 0 states have call successors, (0), 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-16 16:29:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:29:05,627 INFO L93 Difference]: Finished difference Result 4789 states and 17517 transitions. [2022-11-16 16:29:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 16:29:05,627 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 22 states have internal predecessors, (78), 0 states have call successors, (0), 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 29 [2022-11-16 16:29:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:29:05,653 INFO L225 Difference]: With dead ends: 4789 [2022-11-16 16:29:05,653 INFO L226 Difference]: Without dead ends: 4789 [2022-11-16 16:29:05,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=283, Invalid=1049, Unknown=0, NotChecked=0, Total=1332 [2022-11-16 16:29:05,655 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 332 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 16:29:05,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 65 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 558 Invalid, 0 Unknown, 172 Unchecked, 0.5s Time] [2022-11-16 16:29:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2022-11-16 16:29:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 2271. [2022-11-16 16:29:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2271 states, 2270 states have (on average 3.83215859030837) internal successors, (8699), 2270 states have internal predecessors, (8699), 0 states have call successors, (0), 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-16 16:29:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 8699 transitions. [2022-11-16 16:29:05,801 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 8699 transitions. Word has length 29 [2022-11-16 16:29:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:29:05,801 INFO L495 AbstractCegarLoop]: Abstraction has 2271 states and 8699 transitions. [2022-11-16 16:29:05,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 22 states have internal predecessors, (78), 0 states have call successors, (0), 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-16 16:29:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 8699 transitions. [2022-11-16 16:29:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 16:29:05,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:29:05,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:29:05,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 16:29:06,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:06,018 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-16 16:29:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:29:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1579544870, now seen corresponding path program 6 times [2022-11-16 16:29:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:29:06,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665151506] [2022-11-16 16:29:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:29:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:29:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:29:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:06,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:29:06,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665151506] [2022-11-16 16:29:06,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665151506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:29:06,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149403538] [2022-11-16 16:29:06,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 16:29:06,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:29:06,930 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:29:06,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 16:29:07,115 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 16:29:07,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:29:07,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 16:29:07,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:29:07,182 INFO L321 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2022-11-16 16:29:07,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 38 [2022-11-16 16:29:07,250 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 16:29:07,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-11-16 16:29:07,625 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 16:29:07,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-11-16 16:29:07,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-16 16:29:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:07,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:29:08,118 INFO L321 Elim1Store]: treesize reduction 19, result has 81.2 percent of original size [2022-11-16 16:29:08,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 65 treesize of output 114 [2022-11-16 16:29:08,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-16 16:29:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:08,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149403538] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:29:08,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1095134017] [2022-11-16 16:29:08,732 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:336) 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-16 16:29:08,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:29:08,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2022-11-16 16:29:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748525162] [2022-11-16 16:29:08,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:29:08,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 16:29:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:29:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 16:29:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2022-11-16 16:29:08,735 INFO L87 Difference]: Start difference. First operand 2271 states and 8699 transitions. Second operand has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 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-16 16:29:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:29:11,408 INFO L93 Difference]: Finished difference Result 3828 states and 13777 transitions. [2022-11-16 16:29:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 16:29:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 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 29 [2022-11-16 16:29:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:29:11,426 INFO L225 Difference]: With dead ends: 3828 [2022-11-16 16:29:11,426 INFO L226 Difference]: Without dead ends: 3828 [2022-11-16 16:29:11,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=421, Invalid=2441, Unknown=0, NotChecked=0, Total=2862 [2022-11-16 16:29:11,428 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 421 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 465 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 16:29:11,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 154 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 639 Invalid, 0 Unknown, 465 Unchecked, 0.6s Time] [2022-11-16 16:29:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2022-11-16 16:29:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 2488. [2022-11-16 16:29:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 3.8166465621230397) internal successors, (9492), 2487 states have internal predecessors, (9492), 0 states have call successors, (0), 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-16 16:29:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 9492 transitions. [2022-11-16 16:29:11,522 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 9492 transitions. Word has length 29 [2022-11-16 16:29:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:29:11,522 INFO L495 AbstractCegarLoop]: Abstraction has 2488 states and 9492 transitions. [2022-11-16 16:29:11,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 29 states have internal predecessors, (80), 0 states have call successors, (0), 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-16 16:29:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 9492 transitions. [2022-11-16 16:29:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 16:29:11,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:29:11,531 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:29:11,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 16:29:11,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-16 16:29:11,742 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-16 16:29:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:29:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 31098928, now seen corresponding path program 7 times [2022-11-16 16:29:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:29:11,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48507525] [2022-11-16 16:29:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:29:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:29:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:29:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:12,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:29:12,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48507525] [2022-11-16 16:29:12,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48507525] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:29:12,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791825496] [2022-11-16 16:29:12,482 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 16:29:12,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:29:12,484 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:29:12,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 16:29:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:29:12,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 16:29:12,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:29:12,760 INFO L321 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2022-11-16 16:29:12,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 38 [2022-11-16 16:29:12,815 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 16:29:12,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-11-16 16:29:13,038 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 19 treesize of output 21 [2022-11-16 16:29:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:13,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:29:13,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:29:13,351 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 44 treesize of output 40 [2022-11-16 16:29:13,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-16 16:29:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:13,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791825496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:29:13,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [64197293] [2022-11-16 16:29:13,730 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:336) 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-16 16:29:13,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:29:13,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 23 [2022-11-16 16:29:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940494240] [2022-11-16 16:29:13,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:29:13,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 16:29:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:29:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 16:29:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=445, Unknown=1, NotChecked=0, Total=552 [2022-11-16 16:29:13,733 INFO L87 Difference]: Start difference. First operand 2488 states and 9492 transitions. Second operand has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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-16 16:29:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:29:15,352 INFO L93 Difference]: Finished difference Result 4190 states and 14886 transitions. [2022-11-16 16:29:15,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 16:29:15,352 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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 29 [2022-11-16 16:29:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:29:15,369 INFO L225 Difference]: With dead ends: 4190 [2022-11-16 16:29:15,369 INFO L226 Difference]: Without dead ends: 4010 [2022-11-16 16:29:15,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=299, Invalid=1340, Unknown=1, NotChecked=0, Total=1640 [2022-11-16 16:29:15,371 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 274 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 16:29:15,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 75 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 769 Invalid, 0 Unknown, 217 Unchecked, 0.6s Time] [2022-11-16 16:29:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2022-11-16 16:29:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 2657. [2022-11-16 16:29:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2656 states have (on average 3.692394578313253) internal successors, (9807), 2656 states have internal predecessors, (9807), 0 states have call successors, (0), 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-16 16:29:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 9807 transitions. [2022-11-16 16:29:15,467 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 9807 transitions. Word has length 29 [2022-11-16 16:29:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:29:15,467 INFO L495 AbstractCegarLoop]: Abstraction has 2657 states and 9807 transitions. [2022-11-16 16:29:15,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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-16 16:29:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 9807 transitions. [2022-11-16 16:29:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 16:29:15,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:29:15,476 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:29:15,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-16 16:29:15,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:15,682 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-16 16:29:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:29:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1919000236, now seen corresponding path program 8 times [2022-11-16 16:29:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:29:15,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925316054] [2022-11-16 16:29:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:29:15,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:29:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:29:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 16:29:16,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:29:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925316054] [2022-11-16 16:29:16,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925316054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:29:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295440326] [2022-11-16 16:29:16,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 16:29:16,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:29:16,772 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:29:16,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 16:29:17,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 16:29:17,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:29:17,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 16:29:17,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:29:17,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:29:17,221 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 19 treesize of output 21 [2022-11-16 16:29:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 16:29:17,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:29:17,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:29:17,319 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 44 treesize of output 40 [2022-11-16 16:29:17,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-16 16:29:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 16:29:17,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295440326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:29:17,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [790191865] [2022-11-16 16:29:17,453 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:336) 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-16 16:29:17,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:29:17,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 19 [2022-11-16 16:29:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721520756] [2022-11-16 16:29:17,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:29:17,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 16:29:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:29:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 16:29:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=325, Unknown=2, NotChecked=0, Total=380 [2022-11-16 16:29:17,456 INFO L87 Difference]: Start difference. First operand 2657 states and 9807 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 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-16 16:29:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:29:18,498 INFO L93 Difference]: Finished difference Result 4195 states and 15225 transitions. [2022-11-16 16:29:18,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 16:29:18,498 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 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 30 [2022-11-16 16:29:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:29:18,512 INFO L225 Difference]: With dead ends: 4195 [2022-11-16 16:29:18,512 INFO L226 Difference]: Without dead ends: 4195 [2022-11-16 16:29:18,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=799, Unknown=2, NotChecked=0, Total=992 [2022-11-16 16:29:18,513 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 267 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 16:29:18,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 58 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 513 Invalid, 0 Unknown, 49 Unchecked, 0.5s Time] [2022-11-16 16:29:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2022-11-16 16:29:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 2043. [2022-11-16 16:29:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 2042 states have (on average 3.6939275220372183) internal successors, (7543), 2042 states have internal predecessors, (7543), 0 states have call successors, (0), 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-16 16:29:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 7543 transitions. [2022-11-16 16:29:18,590 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 7543 transitions. Word has length 30 [2022-11-16 16:29:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:29:18,590 INFO L495 AbstractCegarLoop]: Abstraction has 2043 states and 7543 transitions. [2022-11-16 16:29:18,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 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-16 16:29:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 7543 transitions. [2022-11-16 16:29:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 16:29:18,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:29:18,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:29:18,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-16 16:29:18,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:18,803 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-16 16:29:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:29:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash 394884042, now seen corresponding path program 1 times [2022-11-16 16:29:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:29:18,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534586668] [2022-11-16 16:29:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:29:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:29:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:29:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:29:20,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:29:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534586668] [2022-11-16 16:29:20,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534586668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:29:20,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356582740] [2022-11-16 16:29:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:29:20,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:29:20,959 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:29:20,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 16:29:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:29:21,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 16:29:21,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:29:21,497 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-16 16:29:21,497 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 42 treesize of output 10 [2022-11-16 16:29:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 16:29:21,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:29:26,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:29:26,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 276 [2022-11-16 16:29:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 16:29:43,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356582740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:29:43,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929996309] [2022-11-16 16:29:43,648 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:336) 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-16 16:29:43,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:29:43,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 7] total 28 [2022-11-16 16:29:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878428659] [2022-11-16 16:29:43,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:29:43,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 16:29:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:29:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 16:29:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=791, Unknown=2, NotChecked=0, Total=870 [2022-11-16 16:29:43,651 INFO L87 Difference]: Start difference. First operand 2043 states and 7543 transitions. Second operand has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 16:29:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:29:45,183 INFO L93 Difference]: Finished difference Result 2353 states and 8308 transitions. [2022-11-16 16:29:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 16:29:45,183 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 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 30 [2022-11-16 16:29:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:29:45,190 INFO L225 Difference]: With dead ends: 2353 [2022-11-16 16:29:45,190 INFO L226 Difference]: Without dead ends: 2307 [2022-11-16 16:29:45,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=175, Invalid=1803, Unknown=2, NotChecked=0, Total=1980 [2022-11-16 16:29:45,192 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 160 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 16:29:45,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 155 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 750 Invalid, 0 Unknown, 264 Unchecked, 0.6s Time] [2022-11-16 16:29:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2022-11-16 16:29:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2097. [2022-11-16 16:29:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2096 states have (on average 3.6860687022900764) internal successors, (7726), 2096 states have internal predecessors, (7726), 0 states have call successors, (0), 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-16 16:29:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 7726 transitions. [2022-11-16 16:29:45,251 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 7726 transitions. Word has length 30 [2022-11-16 16:29:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:29:45,252 INFO L495 AbstractCegarLoop]: Abstraction has 2097 states and 7726 transitions. [2022-11-16 16:29:45,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 16:29:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 7726 transitions. [2022-11-16 16:29:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 16:29:45,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:29:45,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:29:45,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 16:29:45,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-16 16:29:45,465 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-16 16:29:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:29:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash 899676252, now seen corresponding path program 2 times [2022-11-16 16:29:45,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:29:45,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482697253] [2022-11-16 16:29:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:29:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:29:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:29:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:29:47,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:29:47,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482697253] [2022-11-16 16:29:47,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482697253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:29:47,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272117602] [2022-11-16 16:29:47,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 16:29:47,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:29:47,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:29:47,617 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:29:47,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 16:29:48,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 16:29:48,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:29:48,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 16:29:48,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:29:49,038 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-16 16:29:49,038 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 54 treesize of output 14 [2022-11-16 16:29:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:29:49,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:29:50,155 INFO L321 Elim1Store]: treesize reduction 30, result has 87.2 percent of original size [2022-11-16 16:29:50,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 238 [2022-11-16 16:29:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:29:53,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272117602] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:29:53,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [596628184] [2022-11-16 16:29:53,598 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:336) 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-16 16:29:53,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:29:53,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 43 [2022-11-16 16:29:53,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97483111] [2022-11-16 16:29:53,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:29:53,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 16:29:53,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:29:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 16:29:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2022-11-16 16:29:53,601 INFO L87 Difference]: Start difference. First operand 2097 states and 7726 transitions. Second operand has 45 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 16:30:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:30:00,094 INFO L93 Difference]: Finished difference Result 2803 states and 9555 transitions. [2022-11-16 16:30:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 16:30:00,095 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 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 30 [2022-11-16 16:30:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:30:00,100 INFO L225 Difference]: With dead ends: 2803 [2022-11-16 16:30:00,101 INFO L226 Difference]: Without dead ends: 2752 [2022-11-16 16:30:00,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1091, Invalid=6049, Unknown=0, NotChecked=0, Total=7140 [2022-11-16 16:30:00,102 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 471 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 881 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 16:30:00,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 310 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1255 Invalid, 0 Unknown, 881 Unchecked, 1.2s Time] [2022-11-16 16:30:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2022-11-16 16:30:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2329. [2022-11-16 16:30:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2328 states have (on average 3.6142611683848798) internal successors, (8414), 2328 states have internal predecessors, (8414), 0 states have call successors, (0), 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-16 16:30:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 8414 transitions. [2022-11-16 16:30:00,166 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 8414 transitions. Word has length 30 [2022-11-16 16:30:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:30:00,166 INFO L495 AbstractCegarLoop]: Abstraction has 2329 states and 8414 transitions. [2022-11-16 16:30:00,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 16:30:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 8414 transitions. [2022-11-16 16:30:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 16:30:00,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:30:00,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:30:00,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 16:30:00,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:30:00,380 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-16 16:30:00,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:30:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1179159872, now seen corresponding path program 3 times [2022-11-16 16:30:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:30:00,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001535894] [2022-11-16 16:30:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:30:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:30:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:30:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:30:02,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:30:02,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001535894] [2022-11-16 16:30:02,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001535894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:30:02,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082944339] [2022-11-16 16:30:02,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 16:30:02,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:30:02,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:30:02,625 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:30:02,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 16:30:02,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 16:30:02,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 16:30:02,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 16:30:02,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:30:03,289 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-16 16:30:03,289 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 42 treesize of output 10 [2022-11-16 16:30:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 16:30:03,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:30:05,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:30:05,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 279 [2022-11-16 16:30:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 16:30:20,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082944339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:30:20,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [949839930] [2022-11-16 16:30:20,156 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:336) 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-16 16:30:20,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:30:20,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 7] total 28 [2022-11-16 16:30:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079535723] [2022-11-16 16:30:20,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:30:20,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 16:30:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:30:20,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 16:30:20,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2022-11-16 16:30:20,159 INFO L87 Difference]: Start difference. First operand 2329 states and 8414 transitions. Second operand has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 16:30:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:30:22,135 INFO L93 Difference]: Finished difference Result 2702 states and 9252 transitions. [2022-11-16 16:30:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:30:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 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 30 [2022-11-16 16:30:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:30:22,141 INFO L225 Difference]: With dead ends: 2702 [2022-11-16 16:30:22,141 INFO L226 Difference]: Without dead ends: 2681 [2022-11-16 16:30:22,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=169, Invalid=1723, Unknown=0, NotChecked=0, Total=1892 [2022-11-16 16:30:22,142 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 139 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 16:30:22,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 218 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1105 Invalid, 0 Unknown, 451 Unchecked, 0.9s Time] [2022-11-16 16:30:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2022-11-16 16:30:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2394. [2022-11-16 16:30:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2393 states have (on average 3.582950271625575) internal successors, (8574), 2393 states have internal predecessors, (8574), 0 states have call successors, (0), 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-16 16:30:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 8574 transitions. [2022-11-16 16:30:22,208 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 8574 transitions. Word has length 30 [2022-11-16 16:30:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:30:22,208 INFO L495 AbstractCegarLoop]: Abstraction has 2394 states and 8574 transitions. [2022-11-16 16:30:22,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 16:30:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 8574 transitions. [2022-11-16 16:30:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 16:30:22,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:30:22,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:30:22,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 16:30:22,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 16:30:22,423 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-16 16:30:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:30:22,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1659015160, now seen corresponding path program 4 times [2022-11-16 16:30:22,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:30:22,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119646712] [2022-11-16 16:30:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:30:22,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:30:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:30:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:30:26,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:30:26,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119646712] [2022-11-16 16:30:26,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119646712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:30:26,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16762663] [2022-11-16 16:30:26,117 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 16:30:26,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:30:26,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:30:26,120 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 16:30:26,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe53a76e-4e3b-4f30-956c-8190a3e2bbb5/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 16:30:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:30:26,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-16 16:30:26,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:30:26,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:30:26,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:30:26,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:30:26,354 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-16 16:30:26,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-16 16:30:26,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-16 16:30:26,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 16:30:26,648 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 16:30:26,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-11-16 16:30:26,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 16:30:26,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 16:30:26,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 16:30:26,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 16:30:26,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 16:30:27,545 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-16 16:30:27,545 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 44 treesize of output 10 [2022-11-16 16:30:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 16:30:27,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:30:36,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:30:36,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 142 [2022-11-16 16:30:36,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:30:36,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 111343 treesize of output 107251 [2022-11-16 16:30:36,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:30:36,904 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 107151 treesize of output 100951 [2022-11-16 16:30:37,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:30:37,553 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 100863 treesize of output 75799 [2022-11-16 16:30:38,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:30:38,240 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 75225 treesize of output 72169 [2022-11-16 16:30:38,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:30:38,885 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 72567 treesize of output 60079 [2022-11-16 16:40:41,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:40:41,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 142 [2022-11-16 16:40:41,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:40:41,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 221439 treesize of output 213187 [2022-11-16 16:40:42,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:40:42,211 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 213087 treesize of output 206911 [2022-11-16 16:40:43,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:40:43,176 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 206823 treesize of output 194383 [2022-11-16 16:40:43,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:40:43,854 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 194295 treesize of output 144271 [2022-11-16 16:40:44,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:40:44,676 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 144183 treesize of output 119215