./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI --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 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f --- 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-5e519f3 [2022-11-03 04:08:16,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:08:16,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:08:16,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:08:16,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:08:16,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:08:16,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:08:16,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:08:16,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:08:16,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:08:16,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:08:16,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:08:16,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:08:16,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:08:16,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:08:16,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:08:16,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:08:16,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:08:16,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:08:16,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:08:16,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:08:16,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:08:16,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:08:16,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:08:16,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:08:16,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:08:16,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:08:16,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:08:16,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:08:16,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:08:16,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:08:16,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:08:16,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:08:16,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:08:16,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:08:16,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:08:16,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:08:16,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:08:16,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:08:16,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:08:16,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:08:16,993 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 04:08:17,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:08:17,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:08:17,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:08:17,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:08:17,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:08:17,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:08:17,035 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:08:17,035 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:08:17,035 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:08:17,036 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:08:17,037 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:08:17,037 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:08:17,037 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:08:17,037 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:08:17,038 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:08:17,038 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:08:17,038 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:08:17,038 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:08:17,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:08:17,039 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:08:17,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:08:17,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:08:17,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:08:17,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:08:17,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:08:17,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:08:17,043 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:08:17,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:08:17,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:08:17,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:08:17,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:08:17,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:08:17,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:08:17,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:08:17,045 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:08:17,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:08:17,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:08:17,046 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:08:17,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:08:17,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:08:17,046 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:08:17,047 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_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/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_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI 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 -> 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f [2022-11-03 04:08:17,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:08:17,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:08:17,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:08:17,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:08:17,415 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:08:17,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-11-03 04:08:17,484 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/data/9443f4e8f/9df0de49950246719caac7712dc75241/FLAG23a22954a [2022-11-03 04:08:18,015 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:08:18,016 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-11-03 04:08:18,023 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/data/9443f4e8f/9df0de49950246719caac7712dc75241/FLAG23a22954a [2022-11-03 04:08:18,358 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/data/9443f4e8f/9df0de49950246719caac7712dc75241 [2022-11-03 04:08:18,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:08:18,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:08:18,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:08:18,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:08:18,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:08:18,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1336d5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18, skipping insertion in model container [2022-11-03 04:08:18,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:08:18,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:08:18,621 WARN L230 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_3fffff0e-666c-4560-878d-0032656ffc1c/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-11-03 04:08:18,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:08:18,650 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:08:18,692 WARN L230 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_3fffff0e-666c-4560-878d-0032656ffc1c/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-11-03 04:08:18,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:08:18,719 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:08:18,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18 WrapperNode [2022-11-03 04:08:18,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:08:18,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:08:18,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:08:18,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:08:18,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,802 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 229 [2022-11-03 04:08:18,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:08:18,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:08:18,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:08:18,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:08:18,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,862 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:08:18,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:08:18,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:08:18,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:08:18,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (1/1) ... [2022-11-03 04:08:18,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:08:18,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:18,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:08:18,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:08:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:08:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 04:08:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 04:08:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 04:08:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 04:08:18,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 04:08:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 04:08:18,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 04:08:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 04:08:18,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 04:08:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:08:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 04:08:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 04:08:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 04:08:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:08:18,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:08:18,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 04:08:18,978 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 04:08:19,169 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:08:19,171 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:08:19,688 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:08:19,851 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:08:19,851 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 04:08:19,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:08:19 BoogieIcfgContainer [2022-11-03 04:08:19,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:08:19,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:08:19,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:08:19,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:08:19,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:08:18" (1/3) ... [2022-11-03 04:08:19,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e68827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:08:19, skipping insertion in model container [2022-11-03 04:08:19,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:08:18" (2/3) ... [2022-11-03 04:08:19,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e68827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:08:19, skipping insertion in model container [2022-11-03 04:08:19,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:08:19" (3/3) ... [2022-11-03 04:08:19,864 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2022-11-03 04:08:19,877 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 04:08:19,887 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:08:19,888 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 04:08:19,888 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 04:08:20,020 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 04:08:20,055 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 04:08:20,071 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 232 transitions, 488 flow [2022-11-03 04:08:20,080 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 232 transitions, 488 flow [2022-11-03 04:08:20,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 232 transitions, 488 flow [2022-11-03 04:08:20,180 INFO L130 PetriNetUnfolder]: 19/229 cut-off events. [2022-11-03 04:08:20,181 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 04:08:20,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 229 events. 19/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2022-11-03 04:08:20,193 INFO L118 LiptonReduction]: Number of co-enabled transitions 8736 [2022-11-03 04:08:29,768 INFO L133 LiptonReduction]: Checked pairs total: 8886 [2022-11-03 04:08:29,768 INFO L135 LiptonReduction]: Total number of compositions: 250 [2022-11-03 04:08:29,777 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 30 transitions, 84 flow [2022-11-03 04:08:29,808 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 171 states, 170 states have (on average 3.164705882352941) internal successors, (538), 170 states have internal predecessors, (538), 0 states have call successors, (0), 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-03 04:08:29,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:08:29,836 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;@5e152fc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:08:29,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 04:08:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 170 states have (on average 3.164705882352941) internal successors, (538), 170 states have internal predecessors, (538), 0 states have call successors, (0), 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-03 04:08:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 04:08:29,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:29,849 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] [2022-11-03 04:08:29,850 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-03 04:08:29,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:29,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1053139321, now seen corresponding path program 1 times [2022-11-03 04:08:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:29,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727795680] [2022-11-03 04:08:29,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:30,492 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-03 04:08:30,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:30,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727795680] [2022-11-03 04:08:30,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727795680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:30,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:30,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:08:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628479681] [2022-11-03 04:08:30,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:30,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:08:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:30,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:08:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:08:30,543 INFO L87 Difference]: Start difference. First operand has 171 states, 170 states have (on average 3.164705882352941) internal successors, (538), 170 states have internal predecessors, (538), 0 states have call successors, (0), 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 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-03 04:08:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:30,657 INFO L93 Difference]: Finished difference Result 213 states and 678 transitions. [2022-11-03 04:08:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:08:30,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-11-03 04:08:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:30,675 INFO L225 Difference]: With dead ends: 213 [2022-11-03 04:08:30,675 INFO L226 Difference]: Without dead ends: 213 [2022-11-03 04:08:30,676 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-03 04:08:30,680 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:30,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:08:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-03 04:08:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-11-03 04:08:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 3.19811320754717) internal successors, (678), 212 states have internal predecessors, (678), 0 states have call successors, (0), 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-03 04:08:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 678 transitions. [2022-11-03 04:08:30,758 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 678 transitions. Word has length 20 [2022-11-03 04:08:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:30,759 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 678 transitions. [2022-11-03 04:08:30,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-03 04:08:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 678 transitions. [2022-11-03 04:08:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 04:08:30,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:30,762 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-03 04:08:30,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:08:30,763 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-03 04:08:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash -732451219, now seen corresponding path program 1 times [2022-11-03 04:08:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:30,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870061256] [2022-11-03 04:08:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:31,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:31,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870061256] [2022-11-03 04:08:31,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870061256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:08:31,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:08:31,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:08:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028252181] [2022-11-03 04:08:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:31,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:08:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:31,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:08:31,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:08:31,155 INFO L87 Difference]: Start difference. First operand 213 states and 678 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-03 04:08:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:31,296 INFO L93 Difference]: Finished difference Result 214 states and 679 transitions. [2022-11-03 04:08:31,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:08:31,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-03 04:08:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:31,300 INFO L225 Difference]: With dead ends: 214 [2022-11-03 04:08:31,300 INFO L226 Difference]: Without dead ends: 214 [2022-11-03 04:08:31,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03 04:08:31,302 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:31,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 11 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:08:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-03 04:08:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-11-03 04:08:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 3.187793427230047) internal successors, (679), 213 states have internal predecessors, (679), 0 states have call successors, (0), 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-03 04:08:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 679 transitions. [2022-11-03 04:08:31,332 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 679 transitions. Word has length 21 [2022-11-03 04:08:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:31,332 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 679 transitions. [2022-11-03 04:08:31,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-03 04:08:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 679 transitions. [2022-11-03 04:08:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 04:08:31,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:31,341 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-03 04:08:31,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:08:31,342 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-03 04:08:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2085474597, now seen corresponding path program 1 times [2022-11-03 04:08:31,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:31,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277236734] [2022-11-03 04:08:31,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:31,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:31,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277236734] [2022-11-03 04:08:31,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277236734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199404624] [2022-11-03 04:08:31,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:31,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:31,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:31,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 04:08:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:31,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 04:08:31,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:31,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:31,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199404624] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:31,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:08:31,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-11-03 04:08:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720607297] [2022-11-03 04:08:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:08:31,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:08:31,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:31,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:08:31,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-03 04:08:31,918 INFO L87 Difference]: Start difference. First operand 214 states and 679 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-03 04:08:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:32,057 INFO L93 Difference]: Finished difference Result 256 states and 819 transitions. [2022-11-03 04:08:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:08:32,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-03 04:08:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:32,061 INFO L225 Difference]: With dead ends: 256 [2022-11-03 04:08:32,061 INFO L226 Difference]: Without dead ends: 256 [2022-11-03 04:08:32,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-03 04:08:32,063 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:32,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 7 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:08:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-03 04:08:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-11-03 04:08:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 3.211764705882353) internal successors, (819), 255 states have internal predecessors, (819), 0 states have call successors, (0), 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-03 04:08:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 819 transitions. [2022-11-03 04:08:32,099 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 819 transitions. Word has length 22 [2022-11-03 04:08:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:32,099 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 819 transitions. [2022-11-03 04:08:32,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-03 04:08:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 819 transitions. [2022-11-03 04:08:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:08:32,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:32,107 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-03 04:08:32,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:32,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:32,325 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-03 04:08:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1015410351, now seen corresponding path program 1 times [2022-11-03 04:08:32,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:32,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696044725] [2022-11-03 04:08:32,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:32,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:35,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:35,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696044725] [2022-11-03 04:08:35,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696044725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970100556] [2022-11-03 04:08:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:35,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:35,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:35,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:35,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 04:08:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:35,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 04:08:35,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:35,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:35,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 44 [2022-11-03 04:08:36,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:36,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:36,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 93 treesize of output 52 [2022-11-03 04:08:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:36,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:37,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0))) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse1)))) (or (= .cse0 c_~mts1~0) (< .cse0 0)))) .cse2) (or (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse1))) (or (< 0 (+ c_~sum~0 c_~mts2~0 .cse3)) (not (< (+ c_~mts3~0 .cse3) 0))))) (= c_~mts1~0 0)) (or (not .cse2) (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse1))) (or (= c_~mts1~0 (+ c_~sum~0 c_~mts2~0 .cse4)) (< (+ c_~mts3~0 .cse4) 0))))) (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse1))) (let ((.cse5 (+ c_~sum~0 c_~mts2~0 .cse6))) (or (not (< 0 .cse5)) (= c_~mts1~0 .cse5) (not (< (+ c_~mts3~0 .cse6) 0)))))))) is different from false [2022-11-03 04:08:37,253 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0)))) (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse7 (not .cse0))) (and (or (not (<= |c_thread1Thread1of1ForFork1_plus_#res#1| 2147483647)) (not (<= 0 |c_thread1Thread1of1ForFork1_plus_#res#1|)) (let ((.cse1 (+ (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) c_~mts1~0))) (and (or .cse0 (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse2 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse3)))) (or (= .cse1 .cse2) (< .cse2 0))))) (or (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse3))) (or (< 0 (+ c_~sum~0 c_~mts2~0 .cse4)) (not (< (+ c_~mts3~0 .cse4) 0))))) (= .cse1 0)) (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse3))) (let ((.cse5 (+ c_~sum~0 c_~mts2~0 .cse6))) (or (= .cse1 .cse5) (not (< 0 .cse5)) (not (< (+ c_~mts3~0 .cse6) 0)))))) (or .cse7 (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse3))) (or (= .cse1 (+ c_~sum~0 c_~mts2~0 .cse8)) (< (+ c_~mts3~0 .cse8) 0)))))))) (or (not (< |c_thread1Thread1of1ForFork1_plus_#res#1| 0)) (not (<= 0 (+ |c_thread1Thread1of1ForFork1_plus_#res#1| 2147483648))) (and (or (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse9 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse3)))) (or (< .cse9 0) (= .cse9 0)))) .cse0) (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse3))) (or (<= 0 (+ c_~mts3~0 .cse10)) (<= (+ c_~sum~0 c_~mts2~0 .cse10) 0)))) (or (forall ((v_ArrVal_129 (Array Int Int))) (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base) .cse3)) 0)) .cse7)))))) is different from false [2022-11-03 04:08:37,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:37,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 212 treesize of output 168 [2022-11-03 04:08:37,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 142 treesize of output 130 [2022-11-03 04:08:37,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 130 treesize of output 118 [2022-11-03 04:08:37,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 112 [2022-11-03 04:08:37,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:37,571 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:08:37,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 212 treesize of output 96 [2022-11-03 04:08:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:08:38,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970100556] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:38,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [949586134] [2022-11-03 04:08:38,171 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-03 04:08:38,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:38,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-11-03 04:08:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674924938] [2022-11-03 04:08:38,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:38,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:08:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:08:38,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=682, Unknown=2, NotChecked=110, Total=930 [2022-11-03 04:08:38,176 INFO L87 Difference]: Start difference. First operand 256 states and 819 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:08:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:40,506 INFO L93 Difference]: Finished difference Result 702 states and 2260 transitions. [2022-11-03 04:08:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:08:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:08:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:40,513 INFO L225 Difference]: With dead ends: 702 [2022-11-03 04:08:40,513 INFO L226 Difference]: Without dead ends: 688 [2022-11-03 04:08:40,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=240, Invalid=1098, Unknown=2, NotChecked=142, Total=1482 [2022-11-03 04:08:40,514 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 249 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:40,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 956 Invalid, 0 Unknown, 194 Unchecked, 1.2s Time] [2022-11-03 04:08:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-11-03 04:08:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 432. [2022-11-03 04:08:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.2714617169373548) internal successors, (1410), 431 states have internal predecessors, (1410), 0 states have call successors, (0), 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-03 04:08:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1410 transitions. [2022-11-03 04:08:40,582 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1410 transitions. Word has length 24 [2022-11-03 04:08:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:40,583 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 1410 transitions. [2022-11-03 04:08:40,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:08:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1410 transitions. [2022-11-03 04:08:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:08:40,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:40,592 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-03 04:08:40,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:40,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:40,809 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-03 04:08:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1080931667, now seen corresponding path program 2 times [2022-11-03 04:08:40,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:40,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877609833] [2022-11-03 04:08:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:43,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:43,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877609833] [2022-11-03 04:08:43,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877609833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519966351] [2022-11-03 04:08:43,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:08:43,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:43,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:43,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 04:08:43,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:08:43,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:43,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 04:08:43,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:43,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:44,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-03 04:08:44,410 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:08:44,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:08:44,662 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-03 04:08:44,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:45,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:45,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 139 treesize of output 111 [2022-11-03 04:08:46,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 85 treesize of output 79 [2022-11-03 04:08:46,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 67 [2022-11-03 04:08:46,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:46,105 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:08:46,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 28 [2022-11-03 04:08:46,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:46,139 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:08:46,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 46 [2022-11-03 04:08:46,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:46,165 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:08:46,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 46 [2022-11-03 04:08:46,540 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-03 04:08:46,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519966351] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [654444208] [2022-11-03 04:08:46,541 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-03 04:08:46,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:46,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-03 04:08:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728148710] [2022-11-03 04:08:46,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:46,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 04:08:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 04:08:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=904, Unknown=2, NotChecked=0, Total=1056 [2022-11-03 04:08:46,552 INFO L87 Difference]: Start difference. First operand 432 states and 1410 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:08:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:52,650 INFO L93 Difference]: Finished difference Result 856 states and 2812 transitions. [2022-11-03 04:08:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-03 04:08:52,651 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:08:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:52,658 INFO L225 Difference]: With dead ends: 856 [2022-11-03 04:08:52,658 INFO L226 Difference]: Without dead ends: 842 [2022-11-03 04:08:52,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=916, Invalid=3372, Unknown=2, NotChecked=0, Total=4290 [2022-11-03 04:08:52,663 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 269 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:52,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 114 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1968 Invalid, 0 Unknown, 280 Unchecked, 2.3s Time] [2022-11-03 04:08:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-11-03 04:08:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 466. [2022-11-03 04:08:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.2881720430107526) internal successors, (1529), 465 states have internal predecessors, (1529), 0 states have call successors, (0), 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-03 04:08:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1529 transitions. [2022-11-03 04:08:52,698 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1529 transitions. Word has length 24 [2022-11-03 04:08:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:52,698 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 1529 transitions. [2022-11-03 04:08:52,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:08:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1529 transitions. [2022-11-03 04:08:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:08:52,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:52,702 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-03 04:08:52,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:52,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:52,916 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-03 04:08:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1122944083, now seen corresponding path program 3 times [2022-11-03 04:08:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:52,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302564264] [2022-11-03 04:08:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:55,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:55,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302564264] [2022-11-03 04:08:55,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302564264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:55,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631777936] [2022-11-03 04:08:55,093 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:08:55,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:55,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:55,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:55,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 04:08:55,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:08:55,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:55,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 04:08:55,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:55,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:55,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-03 04:08:56,270 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:08:56,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:08:56,519 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-03 04:08:56,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:57,825 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 0 |c_thread1Thread1of1ForFork1_plus_#res#1|))) (let ((.cse4 (not (<= |c_thread1Thread1of1ForFork1_plus_#res#1| 2147483647))) (.cse5 (not .cse3)) (.cse8 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (.cse0 (+ |c_thread1Thread1of1ForFork1_plus_#res#1| 2147483648)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (< .cse0 0) (forall ((v_ArrVal_219 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_219) c_~A~0.base) .cse2))) (or (not (< (+ c_~mts3~0 .cse1) 0)) (< (+ c_~sum~0 .cse1 c_~mts2~0) 1)))) .cse3) (or .cse4 .cse5 (and (forall ((v_ArrVal_219 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_219) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse2))) (or (< (+ c_~mts3~0 .cse6) 0) (< (+ c_~sum~0 .cse6 c_~mts2~0) (+ c_~mts1~0 (select .cse7 .cse8) 1)))))) (forall ((v_ArrVal_219 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_219) c_~A~0.base))) (let ((.cse9 (+ c_~mts3~0 (select .cse10 .cse2)))) (or (< .cse9 0) (= (+ c_~mts1~0 (select .cse10 .cse8)) .cse9))))))) (or .cse4 .cse5 (and (forall ((v_ArrVal_219 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_219) c_~A~0.base))) (or (not (< (+ c_~mts3~0 (select .cse11 .cse2)) 0)) (= (+ c_~mts1~0 (select .cse11 .cse8)) 0)))) (forall ((v_ArrVal_219 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_219) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse2))) (or (not (< (+ c_~mts3~0 .cse12) 0)) (< (+ c_~sum~0 .cse12 c_~mts2~0) (+ c_~mts1~0 (select .cse13 .cse8) 1)))))))) (or (not (< |c_thread1Thread1of1ForFork1_plus_#res#1| 0)) (not (<= 0 .cse0)) (and (forall ((v_ArrVal_219 (Array Int Int))) (let ((.cse14 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_219) c_~A~0.base) .cse2)))) (or (< .cse14 0) (= .cse14 0)))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_219 (Array Int Int))) (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_219) c_~A~0.base) .cse2)) 0)))))))) is different from false [2022-11-03 04:08:57,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:57,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 204 treesize of output 152 [2022-11-03 04:08:57,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:57,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 127 treesize of output 122 [2022-11-03 04:08:57,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:57,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 109 treesize of output 104 [2022-11-03 04:08:58,174 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:08:58,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 99 treesize of output 71 [2022-11-03 04:08:58,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 33 [2022-11-03 04:08:58,242 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:08:58,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 139 treesize of output 103 [2022-11-03 04:08:58,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 85 treesize of output 79 [2022-11-03 04:08:58,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 67 [2022-11-03 04:08:58,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:08:58,318 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:08:58,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 46 [2022-11-03 04:08:58,739 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-03 04:08:58,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631777936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:58,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [260713742] [2022-11-03 04:08:58,741 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-03 04:08:58,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:58,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-03 04:08:58,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132391012] [2022-11-03 04:08:58,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:58,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 04:08:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 04:08:58,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=846, Unknown=1, NotChecked=60, Total=1056 [2022-11-03 04:08:58,746 INFO L87 Difference]: Start difference. First operand 466 states and 1529 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:04,360 INFO L93 Difference]: Finished difference Result 904 states and 2983 transitions. [2022-11-03 04:09:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 04:09:04,361 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:04,367 INFO L225 Difference]: With dead ends: 904 [2022-11-03 04:09:04,367 INFO L226 Difference]: Without dead ends: 891 [2022-11-03 04:09:04,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=845, Invalid=3064, Unknown=1, NotChecked=122, Total=4032 [2022-11-03 04:09:04,369 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 309 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:04,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 123 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1640 Invalid, 0 Unknown, 187 Unchecked, 1.9s Time] [2022-11-03 04:09:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-11-03 04:09:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 472. [2022-11-03 04:09:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.299363057324841) internal successors, (1554), 471 states have internal predecessors, (1554), 0 states have call successors, (0), 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-03 04:09:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1554 transitions. [2022-11-03 04:09:04,397 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1554 transitions. Word has length 24 [2022-11-03 04:09:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:04,397 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1554 transitions. [2022-11-03 04:09:04,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1554 transitions. [2022-11-03 04:09:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:09:04,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:04,400 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-03 04:09:04,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:04,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:04,616 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-03 04:09:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:04,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2100159987, now seen corresponding path program 4 times [2022-11-03 04:09:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:04,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072608019] [2022-11-03 04:09:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:07,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:07,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072608019] [2022-11-03 04:09:07,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072608019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:07,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344380654] [2022-11-03 04:09:07,050 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:07,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:07,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 04:09:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:07,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-03 04:09:07,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:07,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:07,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-03 04:09:08,389 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:09:08,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:09:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:08,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:10,197 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:10,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 139 treesize of output 111 [2022-11-03 04:09:10,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 85 treesize of output 79 [2022-11-03 04:09:10,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 67 [2022-11-03 04:09:10,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:10,304 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:09:10,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 46 [2022-11-03 04:09:10,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:10,341 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:09:10,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 46 [2022-11-03 04:09:10,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:09:10,365 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:09:10,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2022-11-03 04:09:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:10,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344380654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:10,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2077772393] [2022-11-03 04:09:10,740 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-03 04:09:10,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:10,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-11-03 04:09:10,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968499826] [2022-11-03 04:09:10,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:10,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:10,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=803, Unknown=2, NotChecked=0, Total=930 [2022-11-03 04:09:10,743 INFO L87 Difference]: Start difference. First operand 472 states and 1554 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:13,030 INFO L93 Difference]: Finished difference Result 734 states and 2319 transitions. [2022-11-03 04:09:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 04:09:13,031 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:13,037 INFO L225 Difference]: With dead ends: 734 [2022-11-03 04:09:13,037 INFO L226 Difference]: Without dead ends: 714 [2022-11-03 04:09:13,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=288, Invalid=1350, Unknown=2, NotChecked=0, Total=1640 [2022-11-03 04:09:13,039 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 218 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:13,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 75 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 756 Invalid, 0 Unknown, 130 Unchecked, 0.9s Time] [2022-11-03 04:09:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-11-03 04:09:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 486. [2022-11-03 04:09:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 3.292783505154639) internal successors, (1597), 485 states have internal predecessors, (1597), 0 states have call successors, (0), 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-03 04:09:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1597 transitions. [2022-11-03 04:09:13,063 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1597 transitions. Word has length 24 [2022-11-03 04:09:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:13,064 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 1597 transitions. [2022-11-03 04:09:13,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1597 transitions. [2022-11-03 04:09:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:09:13,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:13,067 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-03 04:09:13,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:13,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 04:09:13,285 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-03 04:09:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1884424431, now seen corresponding path program 5 times [2022-11-03 04:09:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:13,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073897365] [2022-11-03 04:09:13,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:13,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:14,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:14,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073897365] [2022-11-03 04:09:14,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073897365] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:14,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181382015] [2022-11-03 04:09:14,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:09:14,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:14,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:14,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:14,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 04:09:15,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:09:15,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:15,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 04:09:15,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:16,061 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:09:16,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:09:16,342 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-03 04:09:16,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:17,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:17,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 126 [2022-11-03 04:09:17,703 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-03 04:09:17,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181382015] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:17,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1325032307] [2022-11-03 04:09:17,704 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-03 04:09:17,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:17,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 04:09:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422716251] [2022-11-03 04:09:17,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:17,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 04:09:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:17,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 04:09:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-11-03 04:09:17,709 INFO L87 Difference]: Start difference. First operand 486 states and 1597 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:20,642 INFO L93 Difference]: Finished difference Result 836 states and 2758 transitions. [2022-11-03 04:09:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 04:09:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:20,648 INFO L225 Difference]: With dead ends: 836 [2022-11-03 04:09:20,649 INFO L226 Difference]: Without dead ends: 822 [2022-11-03 04:09:20,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=464, Invalid=1792, Unknown=0, NotChecked=0, Total=2256 [2022-11-03 04:09:20,650 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 245 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:20,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 86 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1216 Invalid, 0 Unknown, 132 Unchecked, 1.2s Time] [2022-11-03 04:09:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-11-03 04:09:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 518. [2022-11-03 04:09:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 3.3191489361702127) internal successors, (1716), 517 states have internal predecessors, (1716), 0 states have call successors, (0), 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-03 04:09:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1716 transitions. [2022-11-03 04:09:20,681 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1716 transitions. Word has length 24 [2022-11-03 04:09:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:20,682 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 1716 transitions. [2022-11-03 04:09:20,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1716 transitions. [2022-11-03 04:09:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:09:20,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:20,687 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-03 04:09:20,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:20,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 04:09:20,901 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-03 04:09:20,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash 832345259, now seen corresponding path program 6 times [2022-11-03 04:09:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:20,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764732177] [2022-11-03 04:09:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:20,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:22,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:22,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764732177] [2022-11-03 04:09:22,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764732177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:22,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074749014] [2022-11-03 04:09:22,463 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:22,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:22,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:22,465 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:22,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:09:22,636 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:22,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:22,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-03 04:09:22,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:22,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 04:09:22,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:22,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:23,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:23,788 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:09:23,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 84 [2022-11-03 04:09:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:24,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:25,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse0 (+ (select .cse1 .cse3) c_~mts1~0))) (or (not (<= .cse0 2147483647)) (not (< (+ c_~mts3~0 (select .cse1 .cse2)) 0)) (= .cse0 0) (not (<= 0 .cse0)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse3)) (.cse4 (+ c_~mts3~0 (select .cse6 .cse2)))) (or (< .cse4 0) (not (< (+ .cse5 c_~mts1~0) 0)) (not (<= 0 (+ .cse5 c_~mts1~0 2147483648))) (= .cse4 0))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse7 (+ c_~mts3~0 (select .cse9 .cse2))) (.cse8 (+ (select .cse9 .cse3) c_~mts1~0))) (or (< .cse7 0) (not (<= .cse8 2147483647)) (= .cse7 .cse8) (not (<= 0 .cse8)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse3))) (let ((.cse10 (select .cse13 .cse2)) (.cse11 (+ .cse12 c_~mts1~0))) (or (< (+ c_~mts3~0 .cse10) 0) (not (<= .cse11 2147483647)) (< (+ c_~sum~0 .cse10 c_~mts2~0) (+ .cse12 c_~mts1~0 1)) (not (<= 0 .cse11))))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse3))) (let ((.cse15 (select .cse17 .cse2)) (.cse14 (+ .cse16 c_~mts1~0))) (or (not (<= .cse14 2147483647)) (not (< (+ c_~mts3~0 .cse15) 0)) (< (+ c_~sum~0 .cse15 c_~mts2~0) (+ .cse16 c_~mts1~0 1)) (not (<= 0 .cse14))))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse3))) (or (< (+ c_~mts3~0 (select .cse18 .cse2)) 0) (not (< (+ .cse19 c_~mts1~0) 0)) (not (<= 0 (+ .cse19 c_~mts1~0 2147483648)))))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse2)) (.cse21 (select .cse22 .cse3))) (or (not (< (+ c_~mts3~0 .cse20) 0)) (< (+ c_~sum~0 .cse20 c_~mts2~0) 1) (<= 0 (+ .cse21 c_~mts1~0)) (< (+ .cse21 c_~mts1~0 2147483648) 0))))))) is different from false [2022-11-03 04:09:25,656 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse3)) (.cse0 (select .cse2 c_~A~0.offset))) (or (< (+ .cse0 c_~mts1~0 2147483648) 0) (not (< (+ c_~mts3~0 .cse1) 0)) (< (+ c_~sum~0 .cse1 c_~mts2~0) 1) (<= 0 (+ .cse0 c_~mts1~0)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset)) (.cse4 (+ c_~mts3~0 (select .cse6 .cse3)))) (or (< .cse4 0) (not (< (+ .cse5 c_~mts1~0) 0)) (not (<= 0 (+ .cse5 c_~mts1~0 2147483648))) (= .cse4 0))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse7 (+ c_~mts3~0 (select .cse9 .cse3))) (.cse8 (+ (select .cse9 c_~A~0.offset) c_~mts1~0))) (or (< .cse7 0) (not (<= 0 .cse8)) (= .cse7 .cse8) (not (<= .cse8 2147483647)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse11 (select .cse13 c_~A~0.offset))) (let ((.cse10 (select .cse13 .cse3)) (.cse12 (+ .cse11 c_~mts1~0))) (or (< (+ c_~mts3~0 .cse10) 0) (< (+ c_~sum~0 .cse10 c_~mts2~0) (+ .cse11 c_~mts1~0 1)) (not (<= 0 .cse12)) (not (<= .cse12 2147483647))))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse14 .cse3)) 0) (not (< (+ .cse15 c_~mts1~0) 0)) (not (<= 0 (+ .cse15 c_~mts1~0 2147483648)))))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse16 (+ (select .cse17 c_~A~0.offset) c_~mts1~0))) (or (= .cse16 0) (not (< (+ c_~mts3~0 (select .cse17 .cse3)) 0)) (not (<= 0 .cse16)) (not (<= .cse16 2147483647)))))) (forall ((v_ArrVal_357 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse19 (select .cse21 c_~A~0.offset))) (let ((.cse18 (select .cse21 .cse3)) (.cse20 (+ .cse19 c_~mts1~0))) (or (not (< (+ c_~mts3~0 .cse18) 0)) (< (+ c_~sum~0 .cse18 c_~mts2~0) (+ .cse19 c_~mts1~0 1)) (not (<= 0 .cse20)) (not (<= .cse20 2147483647))))))))) is different from false [2022-11-03 04:09:27,486 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (+ c_~mts1~0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= 0 .cse0)) (not (< (+ c_~mts3~0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (<= .cse0 2147483647)) (= .cse0 0))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (+ c_~mts3~0 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse2 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ c_~mts1~0 .cse2 2147483648))) (< .cse3 0) (= .cse3 0) (not (< (+ c_~mts1~0 .cse2) 0)))))))) (or (forall ((~M~0 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ c_~mts1~0 .cse5 2147483648))) (< (+ c_~mts3~0 (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0) (< 0 ~M~0) (< ~M~0 0) (not (< (+ c_~mts1~0 .cse5) 0)))))) (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (+ c_~mts1~0 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse7 (+ c_~mts3~0 (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (< .cse7 0) (not (<= 0 .cse8)) (not (<= .cse8 2147483647)) (= .cse8 .cse7))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse11 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse10 (+ c_~mts1~0 .cse12))) (or (not (<= 0 .cse10)) (not (< (+ c_~mts3~0 .cse11) 0)) (< (+ c_~sum~0 c_~mts2~0 .cse11) (+ c_~mts1~0 .cse12 1)) (not (<= .cse10 2147483647))))))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse14 (select .cse17 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse15 (+ c_~mts1~0 .cse16))) (or (< (+ c_~mts3~0 .cse14) 0) (not (<= 0 .cse15)) (< (+ c_~sum~0 c_~mts2~0 .cse14) (+ c_~mts1~0 .cse16 1)) (not (<= .cse15 2147483647))))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (select .cse20 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (+ c_~sum~0 c_~mts2~0 .cse18) 1) (< (+ c_~mts1~0 .cse19 2147483648) 0) (<= 0 (+ c_~mts1~0 .cse19)) (not (< (+ c_~mts3~0 .cse18) 0)))))) (< 0 ~M~0) (< ~M~0 0)))) is different from false [2022-11-03 04:09:27,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:27,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 158 treesize of output 110 [2022-11-03 04:09:27,622 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:27,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 625 treesize of output 601 [2022-11-03 04:09:27,650 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:27,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 593 treesize of output 525 [2022-11-03 04:09:27,683 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:27,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 505 treesize of output 473 [2022-11-03 04:09:27,717 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:27,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 359 treesize of output 345 [2022-11-03 04:09:28,459 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:09:28,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 132 treesize of output 1 [2022-11-03 04:09:28,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:28,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 132 treesize of output 96 [2022-11-03 04:09:28,496 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:28,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 598 treesize of output 578 [2022-11-03 04:09:28,525 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:28,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 574 treesize of output 514 [2022-11-03 04:09:28,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:28,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 311 [2022-11-03 04:09:28,579 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:28,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 494 treesize of output 466 [2022-11-03 04:09:29,657 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:09:29,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 98 treesize of output 1 [2022-11-03 04:09:29,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:29,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 160 treesize of output 112 [2022-11-03 04:09:29,701 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:29,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1323 treesize of output 1271 [2022-11-03 04:09:29,746 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:29,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1263 treesize of output 1195 [2022-11-03 04:09:29,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:29,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 873 treesize of output 833 [2022-11-03 04:09:29,823 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:29,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1143 treesize of output 1003 [2022-11-03 04:09:31,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:31,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 161 treesize of output 113 [2022-11-03 04:09:31,038 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:31,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5480 treesize of output 5260 [2022-11-03 04:09:31,123 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:31,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5240 treesize of output 4956 [2022-11-03 04:09:31,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:31,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 4222 treesize of output 4062 [2022-11-03 04:09:31,268 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:31,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4760 treesize of output 4188 [2022-11-03 04:09:32,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:32,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 128 treesize of output 92 [2022-11-03 04:09:32,199 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:32,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2392 treesize of output 2316 [2022-11-03 04:09:32,261 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:32,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2312 treesize of output 2268 [2022-11-03 04:09:32,330 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:32,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2264 treesize of output 2076 [2022-11-03 04:09:32,397 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:32,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2072 treesize of output 1980 [2022-11-03 04:09:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:09:34,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074749014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:34,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [305837924] [2022-11-03 04:09:34,302 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-03 04:09:34,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:34,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 33 [2022-11-03 04:09:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365568206] [2022-11-03 04:09:34,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:34,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:09:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:09:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=851, Unknown=5, NotChecked=186, Total=1190 [2022-11-03 04:09:34,306 INFO L87 Difference]: Start difference. First operand 518 states and 1716 transitions. Second operand has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:41,635 INFO L93 Difference]: Finished difference Result 806 states and 2486 transitions. [2022-11-03 04:09:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 04:09:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:41,642 INFO L225 Difference]: With dead ends: 806 [2022-11-03 04:09:41,642 INFO L226 Difference]: Without dead ends: 778 [2022-11-03 04:09:41,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=673, Invalid=2994, Unknown=5, NotChecked=360, Total=4032 [2022-11-03 04:09:41,644 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 312 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:41,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 144 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1756 Invalid, 0 Unknown, 387 Unchecked, 2.0s Time] [2022-11-03 04:09:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-03 04:09:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 533. [2022-11-03 04:09:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 3.327067669172932) internal successors, (1770), 532 states have internal predecessors, (1770), 0 states have call successors, (0), 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-03 04:09:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1770 transitions. [2022-11-03 04:09:41,671 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1770 transitions. Word has length 24 [2022-11-03 04:09:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:41,672 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 1770 transitions. [2022-11-03 04:09:41,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1770 transitions. [2022-11-03 04:09:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:09:41,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:41,675 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-03 04:09:41,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:41,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:41,901 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-03 04:09:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1402852657, now seen corresponding path program 7 times [2022-11-03 04:09:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:41,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754265049] [2022-11-03 04:09:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:43,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:43,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754265049] [2022-11-03 04:09:43,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754265049] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:43,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589289256] [2022-11-03 04:09:43,617 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:43,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:43,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:43,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:43,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:09:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:43,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 04:09:43,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:44,695 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:09:44,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:09:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:44,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:45,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:45,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 124 [2022-11-03 04:09:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:46,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589289256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:46,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [599498266] [2022-11-03 04:09:46,247 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-03 04:09:46,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:46,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-11-03 04:09:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453570513] [2022-11-03 04:09:46,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:46,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 04:09:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 04:09:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2022-11-03 04:09:46,250 INFO L87 Difference]: Start difference. First operand 533 states and 1770 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:47,613 INFO L93 Difference]: Finished difference Result 800 states and 2647 transitions. [2022-11-03 04:09:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:09:47,614 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:47,621 INFO L225 Difference]: With dead ends: 800 [2022-11-03 04:09:47,621 INFO L226 Difference]: Without dead ends: 793 [2022-11-03 04:09:47,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 04:09:47,623 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 145 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:47,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 72 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 492 Invalid, 0 Unknown, 45 Unchecked, 0.5s Time] [2022-11-03 04:09:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-11-03 04:09:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 544. [2022-11-03 04:09:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.3535911602209945) internal successors, (1821), 543 states have internal predecessors, (1821), 0 states have call successors, (0), 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-03 04:09:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1821 transitions. [2022-11-03 04:09:47,654 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1821 transitions. Word has length 24 [2022-11-03 04:09:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:47,656 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 1821 transitions. [2022-11-03 04:09:47,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:09:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1821 transitions. [2022-11-03 04:09:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:09:47,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:47,659 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-03 04:09:47,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-03 04:09:47,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 04:09:47,888 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-03 04:09:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1383068603, now seen corresponding path program 8 times [2022-11-03 04:09:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:47,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638169732] [2022-11-03 04:09:47,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:49,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:49,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638169732] [2022-11-03 04:09:49,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638169732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:49,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496927455] [2022-11-03 04:09:49,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:09:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:49,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:49,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:49,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 04:09:49,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:09:49,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:49,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-03 04:09:49,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:49,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 04:09:49,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:49,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:50,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:50,698 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:09:50,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:09:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:51,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:52,367 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0)))) (let ((.cse11 (not .cse4)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) c_~A~0.base))) (let ((.cse1 (+ c_~mts3~0 (select .cse2 .cse3))) (.cse0 (+ c_~mts1~0 (select .cse2 c_~A~0.offset)))) (or (not (<= .cse0 2147483647)) (< .cse1 0) (not (<= 0 .cse0)) (= .cse1 .cse0))))) .cse4) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) c_~A~0.base))) (let ((.cse5 (+ c_~mts3~0 (select .cse7 .cse3))) (.cse6 (select .cse7 c_~A~0.offset))) (or (< .cse5 0) (= .cse5 0) (not (<= 0 (+ c_~mts1~0 .cse6 2147483648))) (not (< (+ c_~mts1~0 .cse6) 0)))))) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) c_~A~0.base))) (let ((.cse8 (+ c_~mts1~0 (select .cse10 c_~A~0.offset))) (.cse9 (select .cse10 .cse3))) (or (= .cse8 0) (not (<= .cse8 2147483647)) (< 0 (+ c_~sum~0 .cse9 c_~mts2~0)) (not (<= 0 .cse8)) (not (< (+ c_~mts3~0 .cse9) 0)))))) (or .cse11 (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) c_~A~0.base))) (let ((.cse13 (select .cse12 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse12 .cse3)) 0) (not (<= 0 (+ c_~mts1~0 .cse13 2147483648))) (not (< (+ c_~mts1~0 .cse13) 0))))))) (or .cse11 (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse3)) (.cse14 (+ c_~mts1~0 (select .cse16 c_~A~0.offset)))) (or (= .cse14 (+ c_~sum~0 .cse15 c_~mts2~0)) (not (<= .cse14 2147483647)) (< (+ c_~mts3~0 .cse15) 0) (not (<= 0 .cse14))))))) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse3)) (.cse18 (select .cse19 c_~A~0.offset))) (or (<= (+ c_~sum~0 .cse17 c_~mts2~0) 0) (< (+ c_~mts1~0 .cse18 2147483648) 0) (not (< (+ c_~mts3~0 .cse17) 0)) (<= 0 (+ c_~mts1~0 .cse18)))))) (forall ((v_ArrVal_450 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse3))) (let ((.cse20 (+ c_~mts1~0 (select .cse23 c_~A~0.offset))) (.cse21 (+ c_~sum~0 .cse22 c_~mts2~0))) (or (= .cse20 .cse21) (not (<= .cse20 2147483647)) (not (<= 0 .cse20)) (not (< 0 .cse21)) (not (< (+ c_~mts3~0 .cse22) 0)))))))))) is different from false [2022-11-03 04:09:54,158 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0)))) (let ((.cse11 (not .cse10))) (and (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_450 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ c_~mts3~0 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (not (<= 0 (+ c_~mts1~0 .cse0 2147483648))) (= 0 .cse1) (not (< (+ c_~mts1~0 .cse0) 0)) (< .cse1 0))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_450 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse3 (+ c_~mts1~0 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse4 (+ c_~sum~0 c_~mts2~0 .cse5))) (or (not (<= .cse3 2147483647)) (not (<= 0 .cse3)) (= .cse3 .cse4) (not (< (+ c_~mts3~0 .cse5) 0)) (not (< 0 .cse4))))))))) (or (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (~M~0 Int) (v_ArrVal_450 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (+ c_~mts1~0 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse8 (+ c_~mts3~0 (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (not (<= .cse7 2147483647)) (not (<= 0 .cse7)) (< 0 ~M~0) (= .cse7 .cse8) (< ~M~0 0) (< .cse8 0))))) .cse10) (or .cse11 (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (~M~0 Int) (v_ArrVal_450 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (+ c_~mts1~0 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse13 (select .cse14 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse12 2147483647)) (not (<= 0 .cse12)) (< 0 ~M~0) (< ~M~0 0) (= .cse12 (+ c_~sum~0 c_~mts2~0 .cse13)) (< (+ c_~mts3~0 .cse13) 0)))))) (or .cse11 (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (~M~0 Int) (v_ArrVal_450 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (not (<= 0 (+ c_~mts1~0 .cse15 2147483648))) (< ~M~0 0) (not (< (+ c_~mts1~0 .cse15) 0)) (< (+ c_~mts3~0 (select .cse16 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_450 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse19 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse18 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (+ c_~sum~0 c_~mts2~0 .cse17) 0) (not (< (+ c_~mts3~0 .cse17) 0)) (<= 0 (+ c_~mts1~0 .cse18)) (< (+ c_~mts1~0 .cse18 2147483648) 0))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_450 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (+ c_~mts1~0 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse21 (select .cse22 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse20 2147483647)) (not (<= 0 .cse20)) (not (< (+ c_~mts3~0 .cse21) 0)) (= .cse20 0) (< 0 (+ c_~sum~0 c_~mts2~0 .cse21)))))) (< ~M~0 0)))))) is different from false [2022-11-03 04:09:54,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:54,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 98 treesize of output 74 [2022-11-03 04:09:54,289 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:54,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3730 treesize of output 3606 [2022-11-03 04:09:54,349 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:54,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3602 treesize of output 3526 [2022-11-03 04:09:54,409 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:54,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3522 treesize of output 3366 [2022-11-03 04:09:54,470 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:54,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3362 treesize of output 3046 [2022-11-03 04:09:56,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:56,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 159 treesize of output 111 [2022-11-03 04:09:56,271 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:56,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1307 treesize of output 1255 [2022-11-03 04:09:56,305 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:56,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1245 treesize of output 1105 [2022-11-03 04:09:56,335 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:56,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1077 treesize of output 1045 [2022-11-03 04:09:56,364 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:56,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1035 treesize of output 967 [2022-11-03 04:09:56,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:56,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 132 treesize of output 96 [2022-11-03 04:09:56,888 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:56,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5079 treesize of output 4891 [2022-11-03 04:09:56,971 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:56,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4887 treesize of output 4763 [2022-11-03 04:09:57,055 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:57,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4759 treesize of output 4251 [2022-11-03 04:09:57,143 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:57,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4247 treesize of output 3995 [2022-11-03 04:09:59,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:59,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 196 treesize of output 136 [2022-11-03 04:09:59,406 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:59,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1686 treesize of output 1618 [2022-11-03 04:09:59,449 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:59,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1608 treesize of output 1420 [2022-11-03 04:09:59,488 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:59,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1392 treesize of output 1348 [2022-11-03 04:09:59,530 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:09:59,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1338 treesize of output 1246 [2022-11-03 04:10:00,383 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:10:00,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 132 treesize of output 1 [2022-11-03 04:10:00,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:00,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 163 treesize of output 115 [2022-11-03 04:10:00,473 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:10:00,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6237 treesize of output 6017 [2022-11-03 04:10:00,591 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:10:00,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6013 treesize of output 5873 [2022-11-03 04:10:00,761 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:10:00,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5869 treesize of output 5585 [2022-11-03 04:10:00,891 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:10:00,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5581 treesize of output 5009 [2022-11-03 04:11:55,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:11:55,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 158 treesize of output 110 [2022-11-03 04:11:55,673 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:11:55,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2623 treesize of output 2515 [2022-11-03 04:11:55,733 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:11:55,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2495 treesize of output 2427 [2022-11-03 04:11:55,816 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:11:55,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2407 treesize of output 2123 [2022-11-03 04:11:55,913 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:11:55,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1619 treesize of output 1479 [2022-11-03 04:11:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:11:58,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496927455] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:11:58,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1967467130] [2022-11-03 04:11:58,209 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-03 04:11:58,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:11:58,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 34 [2022-11-03 04:11:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975592457] [2022-11-03 04:11:58,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:11:58,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 04:11:58,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:11:58,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 04:11:58,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=956, Unknown=4, NotChecked=130, Total=1260 [2022-11-03 04:11:58,212 INFO L87 Difference]: Start difference. First operand 544 states and 1821 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:11:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:11:59,895 INFO L93 Difference]: Finished difference Result 709 states and 2266 transitions. [2022-11-03 04:11:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:11:59,896 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:11:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:11:59,902 INFO L225 Difference]: With dead ends: 709 [2022-11-03 04:11:59,902 INFO L226 Difference]: Without dead ends: 702 [2022-11-03 04:11:59,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=301, Invalid=1343, Unknown=4, NotChecked=158, Total=1806 [2022-11-03 04:11:59,904 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 114 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:11:59,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 86 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 857 Invalid, 0 Unknown, 598 Unchecked, 0.9s Time] [2022-11-03 04:11:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-11-03 04:11:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 553. [2022-11-03 04:11:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 3.3405797101449277) internal successors, (1844), 552 states have internal predecessors, (1844), 0 states have call successors, (0), 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-03 04:11:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1844 transitions. [2022-11-03 04:11:59,928 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1844 transitions. Word has length 24 [2022-11-03 04:11:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:11:59,928 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 1844 transitions. [2022-11-03 04:11:59,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:11:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1844 transitions. [2022-11-03 04:11:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:11:59,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:11:59,931 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-03 04:11:59,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:12:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 04:12:00,157 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-03 04:12:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:12:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -393592105, now seen corresponding path program 9 times [2022-11-03 04:12:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:12:00,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795302136] [2022-11-03 04:12:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:12:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:12:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:12:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:12:02,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:12:02,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795302136] [2022-11-03 04:12:02,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795302136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:12:02,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030854245] [2022-11-03 04:12:02,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:12:02,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:12:02,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:12:02,567 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:12:02,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:12:02,728 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:12:02,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:12:02,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 04:12:02,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:12:03,535 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:12:03,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:12:03,876 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-03 04:12:03,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:12:04,437 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:04,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 235 treesize of output 127 [2022-11-03 04:12:05,044 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-03 04:12:05,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030854245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:12:05,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [865670368] [2022-11-03 04:12:05,045 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-03 04:12:05,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:12:05,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 29 [2022-11-03 04:12:05,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610314128] [2022-11-03 04:12:05,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:12:05,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:12:05,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:12:05,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:12:05,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-11-03 04:12:05,049 INFO L87 Difference]: Start difference. First operand 553 states and 1844 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:12:15,580 INFO L93 Difference]: Finished difference Result 1319 states and 4334 transitions. [2022-11-03 04:12:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-03 04:12:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:12:15,590 INFO L225 Difference]: With dead ends: 1319 [2022-11-03 04:12:15,591 INFO L226 Difference]: Without dead ends: 1306 [2022-11-03 04:12:15,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1262, Invalid=5544, Unknown=0, NotChecked=0, Total=6806 [2022-11-03 04:12:15,593 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 333 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:12:15,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 96 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2260 Invalid, 0 Unknown, 196 Unchecked, 2.6s Time] [2022-11-03 04:12:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-11-03 04:12:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 563. [2022-11-03 04:12:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 3.3701067615658364) internal successors, (1894), 562 states have internal predecessors, (1894), 0 states have call successors, (0), 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-03 04:12:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1894 transitions. [2022-11-03 04:12:15,628 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1894 transitions. Word has length 24 [2022-11-03 04:12:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:12:15,628 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 1894 transitions. [2022-11-03 04:12:15,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1894 transitions. [2022-11-03 04:12:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:12:15,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:12:15,632 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-03 04:12:15,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:12:15,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 04:12:15,856 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-03 04:12:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:12:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash -100004683, now seen corresponding path program 10 times [2022-11-03 04:12:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:12:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105773753] [2022-11-03 04:12:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:12:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:12:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:12:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:12:17,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:12:17,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105773753] [2022-11-03 04:12:17,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105773753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:12:17,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730132270] [2022-11-03 04:12:17,960 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:12:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:12:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:12:17,962 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:12:17,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 04:12:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:12:18,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 04:12:18,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:12:18,879 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:12:18,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:12:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:12:19,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:12:19,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:19,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 144 treesize of output 76 [2022-11-03 04:12:19,809 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 04:12:19,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 58 [2022-11-03 04:12:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:12:20,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730132270] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:12:20,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [952033452] [2022-11-03 04:12:20,125 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-03 04:12:20,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:12:20,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-11-03 04:12:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652492957] [2022-11-03 04:12:20,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:12:20,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 04:12:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:12:20,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 04:12:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2022-11-03 04:12:20,128 INFO L87 Difference]: Start difference. First operand 563 states and 1894 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:12:22,061 INFO L93 Difference]: Finished difference Result 842 states and 2716 transitions. [2022-11-03 04:12:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:12:22,061 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:12:22,066 INFO L225 Difference]: With dead ends: 842 [2022-11-03 04:12:22,067 INFO L226 Difference]: Without dead ends: 821 [2022-11-03 04:12:22,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 04:12:22,068 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 152 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:12:22,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 100 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 871 Invalid, 0 Unknown, 80 Unchecked, 0.8s Time] [2022-11-03 04:12:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-03 04:12:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 562. [2022-11-03 04:12:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.3672014260249554) internal successors, (1889), 561 states have internal predecessors, (1889), 0 states have call successors, (0), 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-03 04:12:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1889 transitions. [2022-11-03 04:12:22,092 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1889 transitions. Word has length 24 [2022-11-03 04:12:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:12:22,093 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1889 transitions. [2022-11-03 04:12:22,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1889 transitions. [2022-11-03 04:12:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:12:22,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:12:22,096 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-03 04:12:22,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:12:22,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:12:22,320 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-03 04:12:22,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:12:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1216327559, now seen corresponding path program 11 times [2022-11-03 04:12:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:12:22,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394613014] [2022-11-03 04:12:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:12:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:12:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:12:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:12:23,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:12:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394613014] [2022-11-03 04:12:23,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394613014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:12:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742223989] [2022-11-03 04:12:23,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:12:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:12:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:12:23,890 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:12:23,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 04:12:24,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:12:24,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:12:24,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-03 04:12:24,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:12:24,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 04:12:24,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:12:24,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:12:24,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:12:24,845 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:12:24,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 84 [2022-11-03 04:12:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:12:25,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:12:26,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse22 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0)))) (let ((.cse9 (not .cse22)) (.cse5 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset))) (and (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse5))) (let ((.cse0 (+ c_~sum~0 .cse2 c_~mts2~0)) (.cse1 (+ c_~mts1~0 (select .cse3 .cse4)))) (or (not (< 0 .cse0)) (not (<= 0 .cse1)) (not (< (+ c_~mts3~0 .cse2) 0)) (= .cse0 .cse1) (not (<= .cse1 2147483647))))))) (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse4)) (.cse6 (select .cse8 .cse5))) (or (not (< (+ c_~mts3~0 .cse6) 0)) (< (+ c_~mts1~0 2147483648 .cse7) 0) (<= 0 (+ c_~mts1~0 .cse7)) (<= (+ c_~sum~0 .cse6 c_~mts2~0) 0))))) (or .cse9 (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse10 (+ c_~mts1~0 (select .cse12 .cse4))) (.cse11 (select .cse12 .cse5))) (or (not (<= 0 .cse10)) (= (+ c_~sum~0 .cse11 c_~mts2~0) .cse10) (not (<= .cse10 2147483647)) (< (+ c_~mts3~0 .cse11) 0)))))) (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse4)) (.cse14 (+ c_~mts3~0 (select .cse15 .cse5)))) (or (not (< (+ c_~mts1~0 .cse13) 0)) (= .cse14 0) (not (<= 0 (+ c_~mts1~0 2147483648 .cse13))) (< .cse14 0))))) (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse5)) (.cse16 (+ c_~mts1~0 (select .cse18 .cse4)))) (or (not (<= 0 .cse16)) (< 0 (+ c_~sum~0 .cse17 c_~mts2~0)) (not (< (+ c_~mts3~0 .cse17) 0)) (not (<= .cse16 2147483647)) (= .cse16 0))))) (or (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse19 (+ c_~mts1~0 (select .cse21 .cse4))) (.cse20 (+ c_~mts3~0 (select .cse21 .cse5)))) (or (not (<= 0 .cse19)) (= .cse20 .cse19) (not (<= .cse19 2147483647)) (< .cse20 0))))) .cse22) (or .cse9 (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse4))) (or (not (< (+ c_~mts1~0 .cse23) 0)) (not (<= 0 (+ c_~mts1~0 2147483648 .cse23))) (< (+ c_~mts3~0 (select .cse24 .cse5)) 0))))))))) is different from false [2022-11-03 04:12:26,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0)))) (let ((.cse6 (not .cse23)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse3)) (.cse0 (+ (select .cse2 c_~A~0.offset) c_~mts1~0))) (or (= .cse0 0) (< 0 (+ c_~sum~0 .cse1 c_~mts2~0)) (not (< (+ c_~mts3~0 .cse1) 0)) (not (<= 0 .cse0)) (not (<= .cse0 2147483647)))))) (or (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse4 (select .cse5 c_~A~0.offset))) (or (not (< (+ .cse4 c_~mts1~0) 0)) (not (<= 0 (+ .cse4 c_~mts1~0 2147483648))) (< (+ c_~mts3~0 (select .cse5 .cse3)) 0))))) .cse6) (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse7 (select .cse9 c_~A~0.offset)) (.cse8 (+ c_~mts3~0 (select .cse9 .cse3)))) (or (not (< (+ .cse7 c_~mts1~0) 0)) (= .cse8 0) (not (<= 0 (+ .cse7 c_~mts1~0 2147483648))) (< .cse8 0))))) (or .cse6 (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse10 (+ (select .cse12 c_~A~0.offset) c_~mts1~0)) (.cse11 (select .cse12 .cse3))) (or (not (<= 0 .cse10)) (not (<= .cse10 2147483647)) (= (+ c_~sum~0 .cse11 c_~mts2~0) .cse10) (< (+ c_~mts3~0 .cse11) 0)))))) (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse3))) (let ((.cse13 (+ c_~sum~0 .cse14 c_~mts2~0)) (.cse15 (+ (select .cse16 c_~A~0.offset) c_~mts1~0))) (or (not (< 0 .cse13)) (not (< (+ c_~mts3~0 .cse14) 0)) (not (<= 0 .cse15)) (not (<= .cse15 2147483647)) (= .cse13 .cse15)))))) (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse17 (select .cse19 c_~A~0.offset)) (.cse18 (select .cse19 .cse3))) (or (< (+ .cse17 c_~mts1~0 2147483648) 0) (not (< (+ c_~mts3~0 .cse18) 0)) (<= 0 (+ .cse17 c_~mts1~0)) (<= (+ c_~sum~0 .cse18 c_~mts2~0) 0))))) (or (forall ((v_ArrVal_587 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse20 (+ (select .cse22 c_~A~0.offset) c_~mts1~0)) (.cse21 (+ c_~mts3~0 (select .cse22 .cse3)))) (or (not (<= 0 .cse20)) (= .cse21 .cse20) (not (<= .cse20 2147483647)) (< .cse21 0))))) .cse23)))) is different from false [2022-11-03 04:12:26,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0)))) (let ((.cse0 (not .cse8)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse4)) (.cse1 (+ (select .cse3 c_~A~0.offset) c_~mts1~0))) (or (not (<= .cse1 2147483647)) (< (+ .cse2 c_~mts3~0) 0) (= (+ c_~sum~0 .cse2 c_~mts2~0) .cse1) (not (<= 0 .cse1))))))) (or (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse6 (+ (select .cse7 .cse4) c_~mts3~0)) (.cse5 (+ (select .cse7 c_~A~0.offset) c_~mts1~0))) (or (not (<= .cse5 2147483647)) (< .cse6 0) (= .cse6 .cse5) (not (<= 0 .cse5)))))) .cse8) (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse4)) (.cse9 (+ (select .cse11 c_~A~0.offset) c_~mts1~0))) (or (not (<= .cse9 2147483647)) (< 0 (+ c_~sum~0 .cse10 c_~mts2~0)) (= .cse9 0) (not (< (+ .cse10 c_~mts3~0) 0)) (not (<= 0 .cse9)))))) (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse12 (select .cse14 c_~A~0.offset)) (.cse13 (select .cse14 .cse4))) (or (<= 0 (+ .cse12 c_~mts1~0)) (< (+ .cse12 c_~mts1~0 2147483648) 0) (not (< (+ .cse13 c_~mts3~0) 0)) (<= (+ c_~sum~0 .cse13 c_~mts2~0) 0))))) (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse16 (select .cse17 c_~A~0.offset)) (.cse15 (+ (select .cse17 .cse4) c_~mts3~0))) (or (< .cse15 0) (not (<= 0 (+ .cse16 c_~mts1~0 2147483648))) (not (< (+ .cse16 c_~mts1~0) 0)) (= .cse15 0))))) (or (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse19 (select .cse18 c_~A~0.offset))) (or (< (+ (select .cse18 .cse4) c_~mts3~0) 0) (not (<= 0 (+ .cse19 c_~mts1~0 2147483648))) (not (< (+ .cse19 c_~mts1~0) 0)))))) .cse0) (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~A~0.base))) (let ((.cse22 (select .cse23 .cse4))) (let ((.cse21 (+ c_~sum~0 .cse22 c_~mts2~0)) (.cse20 (+ (select .cse23 c_~A~0.offset) c_~mts1~0))) (or (not (<= .cse20 2147483647)) (= .cse21 .cse20) (not (< 0 .cse21)) (not (< (+ .cse22 c_~mts3~0) 0)) (not (<= 0 .cse20)))))))))) is different from false [2022-11-03 04:12:27,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:27,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 158 treesize of output 110 [2022-11-03 04:12:27,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:27,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1291 treesize of output 1245 [2022-11-03 04:12:27,855 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:27,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1235 treesize of output 1173 [2022-11-03 04:12:27,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:27,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1163 treesize of output 1029 [2022-11-03 04:12:27,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:27,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 773 treesize of output 747 [2022-11-03 04:12:30,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:30,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 163 treesize of output 115 [2022-11-03 04:12:30,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:30,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1521 treesize of output 1475 [2022-11-03 04:12:30,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:30,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1465 treesize of output 1403 [2022-11-03 04:12:30,919 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:30,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1393 treesize of output 1259 [2022-11-03 04:12:30,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:30,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1011 treesize of output 985 [2022-11-03 04:12:36,290 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:36,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 98 treesize of output 74 [2022-11-03 04:12:36,318 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:36,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 910 treesize of output 882 [2022-11-03 04:12:36,349 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:36,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 878 treesize of output 862 [2022-11-03 04:12:36,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:36,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 708 treesize of output 668 [2022-11-03 04:12:36,394 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:36,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 818 treesize of output 742 [2022-11-03 04:12:36,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:36,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 196 treesize of output 136 [2022-11-03 04:12:36,846 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:36,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 818 treesize of output 786 [2022-11-03 04:12:36,877 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:36,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 779 treesize of output 735 [2022-11-03 04:12:36,910 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:36,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 725 treesize of output 633 [2022-11-03 04:12:36,967 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:36,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 562 treesize of output 542 [2022-11-03 04:12:37,781 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:12:37,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 132 treesize of output 1 [2022-11-03 04:12:37,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:37,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 132 treesize of output 96 [2022-11-03 04:12:37,823 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:37,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1238 treesize of output 1194 [2022-11-03 04:12:37,869 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:37,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1190 treesize of output 1066 [2022-11-03 04:12:37,907 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:37,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1062 treesize of output 1034 [2022-11-03 04:12:37,943 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:37,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1030 treesize of output 970 [2022-11-03 04:12:43,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:43,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 159 treesize of output 111 [2022-11-03 04:12:43,830 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:43,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1307 treesize of output 1255 [2022-11-03 04:12:43,870 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:43,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1245 treesize of output 1177 [2022-11-03 04:12:43,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:12:43,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 863 treesize of output 821 [2022-11-03 04:12:43,937 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:12:43,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1119 treesize of output 979 [2022-11-03 04:12:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:12:44,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742223989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:12:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [571767204] [2022-11-03 04:12:44,951 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-03 04:12:44,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:12:44,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-03 04:12:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722435921] [2022-11-03 04:12:44,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:12:44,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 04:12:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:12:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 04:12:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=737, Unknown=3, NotChecked=174, Total=1056 [2022-11-03 04:12:44,957 INFO L87 Difference]: Start difference. First operand 562 states and 1889 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:12:47,677 INFO L93 Difference]: Finished difference Result 898 states and 2932 transitions. [2022-11-03 04:12:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 04:12:47,677 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:12:47,682 INFO L225 Difference]: With dead ends: 898 [2022-11-03 04:12:47,683 INFO L226 Difference]: Without dead ends: 885 [2022-11-03 04:12:47,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=325, Invalid=1244, Unknown=3, NotChecked=234, Total=1806 [2022-11-03 04:12:47,684 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 172 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 616 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:12:47,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 124 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1168 Invalid, 0 Unknown, 616 Unchecked, 1.2s Time] [2022-11-03 04:12:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-03 04:12:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 578. [2022-11-03 04:12:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 3.386481802426343) internal successors, (1954), 577 states have internal predecessors, (1954), 0 states have call successors, (0), 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-03 04:12:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1954 transitions. [2022-11-03 04:12:47,708 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1954 transitions. Word has length 24 [2022-11-03 04:12:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:12:47,708 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 1954 transitions. [2022-11-03 04:12:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:12:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1954 transitions. [2022-11-03 04:12:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:12:47,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:12:47,711 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-03 04:12:47,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 04:12:47,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 04:12:47,937 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-03 04:12:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:12:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1276540965, now seen corresponding path program 12 times [2022-11-03 04:12:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:12:47,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763418759] [2022-11-03 04:12:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:12:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:12:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:12:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:12:49,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:12:49,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763418759] [2022-11-03 04:12:49,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763418759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:12:49,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877671749] [2022-11-03 04:12:49,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:12:49,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:12:49,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:12:49,713 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:12:49,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:12:49,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:12:49,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:12:49,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 04:12:49,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:12:50,531 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:12:50,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:12:50,753 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-03 04:12:50,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:12:51,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:12:51,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 170 treesize of output 124 [2022-11-03 04:12:51,946 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-03 04:12:51,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877671749] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:12:51,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [267018040] [2022-11-03 04:12:51,947 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-03 04:12:51,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:12:51,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-11-03 04:12:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004126807] [2022-11-03 04:12:51,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:12:51,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:12:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:12:51,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:12:51,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2022-11-03 04:12:51,951 INFO L87 Difference]: Start difference. First operand 578 states and 1954 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:13:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:13:06,524 INFO L93 Difference]: Finished difference Result 1588 states and 5132 transitions. [2022-11-03 04:13:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-03 04:13:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:13:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:13:06,530 INFO L225 Difference]: With dead ends: 1588 [2022-11-03 04:13:06,530 INFO L226 Difference]: Without dead ends: 1539 [2022-11-03 04:13:06,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1136, Invalid=7236, Unknown=0, NotChecked=0, Total=8372 [2022-11-03 04:13:06,533 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 369 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 3386 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 4041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:13:06,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 278 Invalid, 4041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3386 Invalid, 0 Unknown, 617 Unchecked, 3.4s Time] [2022-11-03 04:13:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2022-11-03 04:13:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 593. [2022-11-03 04:13:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 3.3969594594594597) internal successors, (2011), 592 states have internal predecessors, (2011), 0 states have call successors, (0), 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-03 04:13:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2011 transitions. [2022-11-03 04:13:06,565 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2011 transitions. Word has length 24 [2022-11-03 04:13:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:13:06,566 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 2011 transitions. [2022-11-03 04:13:06,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:13:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2011 transitions. [2022-11-03 04:13:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:13:06,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:13:06,569 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-03 04:13:06,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:13:06,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 04:13:06,793 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-03 04:13:06,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:13:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash 580917135, now seen corresponding path program 13 times [2022-11-03 04:13:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:13:06,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092752225] [2022-11-03 04:13:06,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:13:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:13:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:13:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:13:07,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:13:07,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092752225] [2022-11-03 04:13:07,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092752225] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:13:07,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504670462] [2022-11-03 04:13:07,961 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:13:07,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:13:07,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:13:07,965 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:13:07,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 04:13:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:13:08,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 04:13:08,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:13:08,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 04:13:08,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:13:08,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:13:08,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:13:08,826 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:13:08,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 84 [2022-11-03 04:13:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:13:09,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:13:10,402 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_680 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse1 (+ c_~mts3~0 (select .cse2 .cse3))) (.cse0 (select .cse2 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse0) 0)) (= .cse1 0) (< .cse1 0) (not (<= 0 (+ c_~mts1~0 2147483648 .cse0))))))) (forall ((v_ArrVal_680 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset))) (let ((.cse4 (select .cse7 .cse3)) (.cse6 (+ c_~mts1~0 .cse5))) (or (< (+ c_~sum~0 c_~mts2~0 .cse4) (+ c_~mts1~0 .cse5 1)) (not (<= 0 .cse6)) (< (+ c_~mts3~0 .cse4) 0) (not (<= .cse6 2147483647))))))) (forall ((v_ArrVal_680 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse3)) (.cse8 (select .cse10 c_~A~0.offset))) (or (<= 0 (+ c_~mts1~0 .cse8)) (not (< (+ c_~mts3~0 .cse9) 0)) (< (+ c_~sum~0 c_~mts2~0 .cse9) 1) (< (+ c_~mts1~0 2147483648 .cse8) 0))))) (forall ((v_ArrVal_680 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse12 (+ c_~mts1~0 (select .cse11 c_~A~0.offset)))) (or (not (< (+ c_~mts3~0 (select .cse11 .cse3)) 0)) (not (<= 0 .cse12)) (= .cse12 0) (not (<= .cse12 2147483647)))))) (or (forall ((v_ArrVal_680 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse13 (select .cse14 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse13) 0)) (< (+ c_~mts3~0 (select .cse14 .cse3)) 0) (not (<= 0 (+ c_~mts1~0 2147483648 .cse13))))))) (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1))) (forall ((v_ArrVal_680 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse16 (+ c_~mts3~0 (select .cse17 .cse3))) (.cse15 (+ c_~mts1~0 (select .cse17 c_~A~0.offset)))) (or (= .cse15 .cse16) (not (<= 0 .cse15)) (< .cse16 0) (not (<= .cse15 2147483647)))))) (forall ((v_ArrVal_680 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse19 (select .cse21 c_~A~0.offset))) (let ((.cse18 (select .cse21 .cse3)) (.cse20 (+ c_~mts1~0 .cse19))) (or (not (< (+ c_~mts3~0 .cse18) 0)) (< (+ c_~sum~0 c_~mts2~0 .cse18) (+ c_~mts1~0 .cse19 1)) (not (<= 0 .cse20)) (not (<= .cse20 2147483647))))))))) is different from false [2022-11-03 04:13:10,697 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset))) (let ((.cse0 (+ .cse2 c_~mts1~0)) (.cse1 (select .cse3 .cse4))) (or (not (<= .cse0 2147483647)) (not (<= 0 .cse0)) (< (+ c_~sum~0 .cse1 c_~mts2~0) (+ .cse2 c_~mts1~0 1)) (not (< (+ c_~mts3~0 .cse1) 0))))))) (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse5 (+ (select .cse7 c_~A~0.offset) c_~mts1~0)) (.cse6 (+ c_~mts3~0 (select .cse7 .cse4)))) (or (not (<= .cse5 2147483647)) (not (<= 0 .cse5)) (= .cse6 .cse5) (< .cse6 0))))) (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset))) (let ((.cse8 (+ .cse10 c_~mts1~0)) (.cse9 (select .cse11 .cse4))) (or (not (<= .cse8 2147483647)) (not (<= 0 .cse8)) (< (+ c_~sum~0 .cse9 c_~mts2~0) (+ .cse10 c_~mts1~0 1)) (< (+ c_~mts3~0 .cse9) 0)))))) (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse12 (+ (select .cse13 c_~A~0.offset) c_~mts1~0))) (or (= .cse12 0) (not (<= .cse12 2147483647)) (not (<= 0 .cse12)) (not (< (+ c_~mts3~0 (select .cse13 .cse4)) 0)))))) (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse14 (select .cse16 c_~A~0.offset)) (.cse15 (select .cse16 .cse4))) (or (< (+ .cse14 c_~mts1~0 2147483648) 0) (< (+ c_~sum~0 .cse15 c_~mts2~0) 1) (<= 0 (+ .cse14 c_~mts1~0)) (not (< (+ c_~mts3~0 .cse15) 0)))))) (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse18 (+ c_~mts3~0 (select .cse19 .cse4))) (.cse17 (select .cse19 c_~A~0.offset))) (or (not (< (+ .cse17 c_~mts1~0) 0)) (= .cse18 0) (< .cse18 0) (not (<= 0 (+ .cse17 c_~mts1~0 2147483648))))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_680) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (not (< (+ .cse20 c_~mts1~0) 0)) (< (+ c_~mts3~0 (select .cse21 .cse4)) 0) (not (<= 0 (+ .cse20 c_~mts1~0 2147483648)))))))))) is different from false [2022-11-03 04:13:11,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:13:11,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 132 treesize of output 96 [2022-11-03 04:13:11,715 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:13:11,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10199 treesize of output 9825 [2022-11-03 04:13:11,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:13:11,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7235 treesize of output 6989 [2022-11-03 04:13:11,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:13:11,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9559 treesize of output 9057 [2022-11-03 04:13:11,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:13:11,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9047 treesize of output 8033 [2022-11-03 04:18:24,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:18:24,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 132 treesize of output 96 [2022-11-03 04:18:24,421 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:24,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2518 treesize of output 2426 [2022-11-03 04:18:24,477 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:24,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2422 treesize of output 2170 [2022-11-03 04:18:24,534 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:24,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2166 treesize of output 2042 [2022-11-03 04:18:24,592 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:24,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1554 treesize of output 1494 [2022-11-03 04:18:25,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:18:25,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 160 treesize of output 112 [2022-11-03 04:18:26,026 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:26,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5415 treesize of output 5195 [2022-11-03 04:18:26,108 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:26,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5175 treesize of output 4891 [2022-11-03 04:18:26,184 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:26,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4855 treesize of output 4715 [2022-11-03 04:18:26,266 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:26,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4695 treesize of output 4123 [2022-11-03 04:18:30,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:18:30,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 161 treesize of output 113 [2022-11-03 04:18:30,954 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:30,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 650 treesize of output 626 [2022-11-03 04:18:30,991 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:30,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 620 treesize of output 552 [2022-11-03 04:18:31,027 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:31,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 540 treesize of output 508 [2022-11-03 04:18:31,067 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:31,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 437 treesize of output 423 [2022-11-03 04:18:31,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:18:31,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 128 treesize of output 92 [2022-11-03 04:18:31,816 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:31,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 568 treesize of output 552 [2022-11-03 04:18:31,846 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:31,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 548 treesize of output 504 [2022-11-03 04:18:31,878 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:31,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 500 treesize of output 480 [2022-11-03 04:18:31,910 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:31,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 421 treesize of output 413 [2022-11-03 04:18:33,011 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:18:33,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 98 treesize of output 1 [2022-11-03 04:18:33,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:18:33,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 158 treesize of output 110 [2022-11-03 04:18:33,075 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:33,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5287 treesize of output 5067 [2022-11-03 04:18:33,163 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:33,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5031 treesize of output 4891 [2022-11-03 04:18:33,252 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:33,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4855 treesize of output 4571 [2022-11-03 04:18:33,340 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:18:33,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4503 treesize of output 3931 [2022-11-03 04:18:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:18:38,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504670462] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:18:38,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [241182328] [2022-11-03 04:18:38,519 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-03 04:18:38,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:18:38,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:18:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288870865] [2022-11-03 04:18:38,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:18:38,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:18:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:18:38,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:18:38,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=752, Unknown=2, NotChecked=114, Total=992 [2022-11-03 04:18:38,522 INFO L87 Difference]: Start difference. First operand 593 states and 2011 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:18:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:18:41,457 INFO L93 Difference]: Finished difference Result 808 states and 2733 transitions. [2022-11-03 04:18:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:18:41,458 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:18:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:18:41,463 INFO L225 Difference]: With dead ends: 808 [2022-11-03 04:18:41,463 INFO L226 Difference]: Without dead ends: 801 [2022-11-03 04:18:41,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=311, Invalid=1335, Unknown=2, NotChecked=158, Total=1806 [2022-11-03 04:18:41,464 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 214 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:18:41,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 114 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 937 Invalid, 0 Unknown, 225 Unchecked, 1.0s Time] [2022-11-03 04:18:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-11-03 04:18:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 598. [2022-11-03 04:18:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 3.407035175879397) internal successors, (2034), 597 states have internal predecessors, (2034), 0 states have call successors, (0), 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-03 04:18:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 2034 transitions. [2022-11-03 04:18:41,488 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 2034 transitions. Word has length 24 [2022-11-03 04:18:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:18:41,489 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 2034 transitions. [2022-11-03 04:18:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:18:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 2034 transitions. [2022-11-03 04:18:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:18:41,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:18:41,492 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-03 04:18:41,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 04:18:41,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:18:41,708 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-03 04:18:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:18:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash -490946091, now seen corresponding path program 14 times [2022-11-03 04:18:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:18:41,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691215367] [2022-11-03 04:18:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:18:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:18:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:18:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:18:43,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:18:43,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691215367] [2022-11-03 04:18:43,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691215367] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:18:43,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700520613] [2022-11-03 04:18:43,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:18:43,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:18:43,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:18:43,370 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:18:43,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 04:18:43,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:18:43,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:18:43,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 04:18:43,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:18:44,312 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:18:44,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:18:44,498 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-03 04:18:44,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:18:44,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:18:44,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 126 [2022-11-03 04:18:45,576 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-03 04:18:45,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700520613] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:18:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1026718801] [2022-11-03 04:18:45,577 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-03 04:18:45,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:18:45,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-11-03 04:18:45,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290453886] [2022-11-03 04:18:45,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:18:45,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:18:45,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:18:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:18:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-11-03 04:18:45,579 INFO L87 Difference]: Start difference. First operand 598 states and 2034 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:18:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:18:52,787 INFO L93 Difference]: Finished difference Result 1152 states and 3738 transitions. [2022-11-03 04:18:52,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-03 04:18:52,793 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:18:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:18:52,799 INFO L225 Difference]: With dead ends: 1152 [2022-11-03 04:18:52,799 INFO L226 Difference]: Without dead ends: 1124 [2022-11-03 04:18:52,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=816, Invalid=3876, Unknown=0, NotChecked=0, Total=4692 [2022-11-03 04:18:52,801 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 269 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:18:52,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 128 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2007 Invalid, 0 Unknown, 229 Unchecked, 2.0s Time] [2022-11-03 04:18:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2022-11-03 04:18:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 593. [2022-11-03 04:18:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 3.4138513513513513) internal successors, (2021), 592 states have internal predecessors, (2021), 0 states have call successors, (0), 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-03 04:18:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2021 transitions. [2022-11-03 04:18:52,827 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2021 transitions. Word has length 24 [2022-11-03 04:18:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:18:52,827 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 2021 transitions. [2022-11-03 04:18:52,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:18:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2021 transitions. [2022-11-03 04:18:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:18:52,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:18:52,830 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-03 04:18:52,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 04:18:53,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 04:18:53,057 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-03 04:18:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:18:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1412078637, now seen corresponding path program 15 times [2022-11-03 04:18:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:18:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576231241] [2022-11-03 04:18:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:18:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:18:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:18:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:18:54,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:18:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576231241] [2022-11-03 04:18:54,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576231241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:18:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670347904] [2022-11-03 04:18:54,521 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:18:54,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:18:54,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:18:54,522 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:18:54,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 04:18:54,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:18:54,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:18:54,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 04:18:54,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:18:55,259 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:18:55,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2022-11-03 04:18:55,450 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-03 04:18:55,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:18:56,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:18:56,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 126 [2022-11-03 04:18:56,608 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-03 04:18:56,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670347904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:18:56,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1843615038] [2022-11-03 04:18:56,609 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-03 04:18:56,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:18:56,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-11-03 04:18:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323598690] [2022-11-03 04:18:56,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:18:56,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:18:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:18:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:18:56,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-11-03 04:18:56,612 INFO L87 Difference]: Start difference. First operand 593 states and 2021 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:19:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:19:10,386 INFO L93 Difference]: Finished difference Result 1656 states and 5255 transitions. [2022-11-03 04:19:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-03 04:19:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:19:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:19:10,398 INFO L225 Difference]: With dead ends: 1656 [2022-11-03 04:19:10,398 INFO L226 Difference]: Without dead ends: 1621 [2022-11-03 04:19:10,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2232 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1182, Invalid=6828, Unknown=0, NotChecked=0, Total=8010 [2022-11-03 04:19:10,400 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 326 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2969 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:19:10,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 118 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2969 Invalid, 0 Unknown, 133 Unchecked, 3.0s Time] [2022-11-03 04:19:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2022-11-03 04:19:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 597. [2022-11-03 04:19:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 3.411073825503356) internal successors, (2033), 596 states have internal predecessors, (2033), 0 states have call successors, (0), 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-03 04:19:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 2033 transitions. [2022-11-03 04:19:10,431 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 2033 transitions. Word has length 24 [2022-11-03 04:19:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:19:10,431 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 2033 transitions. [2022-11-03 04:19:10,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:19:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 2033 transitions. [2022-11-03 04:19:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:19:10,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:19:10,434 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-03 04:19:10,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 04:19:10,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 04:19:10,649 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-03 04:19:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:19:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1883762671, now seen corresponding path program 16 times [2022-11-03 04:19:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:19:10,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760879989] [2022-11-03 04:19:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:19:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:19:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:19:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:19:11,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:19:11,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760879989] [2022-11-03 04:19:11,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760879989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:19:11,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955403216] [2022-11-03 04:19:11,817 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:19:11,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:19:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:19:11,818 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:19:11,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 04:19:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:19:11,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-03 04:19:11,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:19:12,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 04:19:12,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:19:12,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:19:12,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-11-03 04:19:12,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 44 [2022-11-03 04:19:12,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:19:12,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:19:12,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 93 treesize of output 52 [2022-11-03 04:19:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:19:12,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:19:13,248 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~mts1~0 1)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_820 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse2))) (or (< (+ c_~sum~0 .cse0 c_~mts2~0) .cse1) (< (+ c_~mts3~0 .cse0) 0)))) (or (forall ((v_ArrVal_820 (Array Int Int))) (not (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse2)) 0))) (= c_~mts1~0 0)) (forall ((v_ArrVal_820 (Array Int Int))) (let ((.cse3 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse2)))) (or (= c_~mts1~0 .cse3) (< .cse3 0)))) (forall ((v_ArrVal_820 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse2))) (or (< (+ c_~sum~0 .cse4 c_~mts2~0) .cse1) (not (< (+ c_~mts3~0 .cse4) 0))))))) is different from false [2022-11-03 04:19:13,361 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~mts1~0 1)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse2))) (or (< (+ c_~sum~0 .cse0 c_~mts2~0) .cse1) (not (< (+ c_~mts3~0 .cse0) 0))))) (or (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (not (< (+ c_~mts3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse2)) 0))) (= c_~mts1~0 0)) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse2))) (or (< (+ c_~sum~0 .cse3 c_~mts2~0) .cse1) (< (+ c_~mts3~0 .cse3) 0)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse4 (+ c_~mts3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse2)))) (or (= .cse4 c_~mts1~0) (< .cse4 0)))))) is different from false [2022-11-03 04:19:13,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse0 (+ c_~mts3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse1)))) (or (= .cse0 0) (< .cse0 0)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse1))) (or (< (+ c_~sum~0 .cse2 c_~mts2~0) 1) (not (< (+ c_~mts3~0 .cse2) 0))))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse1))) (or (< (+ c_~sum~0 .cse3 c_~mts2~0) 1) (< (+ c_~mts3~0 .cse3) 0))))) (not (< |c_thread1Thread1of1ForFork1_plus_#res#1| 0)) (not (<= 0 (+ |c_thread1Thread1of1ForFork1_plus_#res#1| 2147483648)))) (or (not (<= |c_thread1Thread1of1ForFork1_plus_#res#1| 2147483647)) (not (<= 0 |c_thread1Thread1of1ForFork1_plus_#res#1|)) (let ((.cse9 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)))) (let ((.cse5 (+ .cse9 c_~mts1~0 1)) (.cse7 (+ .cse9 c_~mts1~0))) (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse1))) (or (not (< (+ c_~mts3~0 .cse4) 0)) (< (+ c_~sum~0 .cse4 c_~mts2~0) .cse5)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse1))) (or (< (+ c_~mts3~0 .cse6) 0) (< (+ c_~sum~0 .cse6 c_~mts2~0) .cse5)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse8 (+ c_~mts3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse1)))) (or (= .cse7 .cse8) (< .cse8 0)))) (or (= .cse7 0) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (not (< (+ c_~mts3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_820) c_~A~0.base) .cse1)) 0)))))))))) is different from false [2022-11-03 04:19:22,551 WARN L234 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:19:22,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:19:22,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 142 treesize of output 94 [2022-11-03 04:19:22,691 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:19:22,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5011 treesize of output 4565 [2022-11-03 04:19:22,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4507 treesize of output 3931 [2022-11-03 04:19:22,751 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:19:22,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3979 treesize of output 3713 [2022-11-03 04:19:22,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3659 treesize of output 3371 [2022-11-03 04:20:44,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:20:44,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 122 treesize of output 86 [2022-11-03 04:20:44,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:20:44,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:20:44,815 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:20:44,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 130 treesize of output 110 [2022-11-03 04:20:44,829 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:20:44,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 95 treesize of output 83 [2022-11-03 04:20:44,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:20:44,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 110 treesize of output 74 [2022-11-03 04:20:44,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:20:44,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:20:44,932 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:20:44,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 102 [2022-11-03 04:20:44,947 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:20:44,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 80 [2022-11-03 04:20:44,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:20:44,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 140 treesize of output 92 [2022-11-03 04:20:45,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:20:45,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:20:45,015 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:20:45,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 187 treesize of output 151 [2022-11-03 04:20:45,033 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:20:45,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 133 treesize of output 111 [2022-11-03 04:20:45,102 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:20:45,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 120 treesize of output 1 [2022-11-03 04:20:45,117 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:20:45,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 143 treesize of output 1 [2022-11-03 04:20:45,132 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:20:45,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 121 treesize of output 1 [2022-11-03 04:20:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:20:45,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955403216] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:45,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [134030488] [2022-11-03 04:20:45,255 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-03 04:20:45,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:45,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:20:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393417749] [2022-11-03 04:20:45,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:45,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:20:45,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:45,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:20:45,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=697, Unknown=4, NotChecked=168, Total=992 [2022-11-03 04:20:45,257 INFO L87 Difference]: Start difference. First operand 597 states and 2033 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:20:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:47,097 INFO L93 Difference]: Finished difference Result 1088 states and 3589 transitions. [2022-11-03 04:20:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:20:47,097 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:20:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:47,102 INFO L225 Difference]: With dead ends: 1088 [2022-11-03 04:20:47,102 INFO L226 Difference]: Without dead ends: 1067 [2022-11-03 04:20:47,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=232, Invalid=1182, Unknown=4, NotChecked=222, Total=1640 [2022-11-03 04:20:47,103 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 230 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 491 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:47,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 99 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 924 Invalid, 0 Unknown, 491 Unchecked, 0.8s Time] [2022-11-03 04:20:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-03 04:20:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 599. [2022-11-03 04:20:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 3.4063545150501673) internal successors, (2037), 598 states have internal predecessors, (2037), 0 states have call successors, (0), 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-03 04:20:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 2037 transitions. [2022-11-03 04:20:47,122 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 2037 transitions. Word has length 24 [2022-11-03 04:20:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:47,122 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 2037 transitions. [2022-11-03 04:20:47,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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-03 04:20:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 2037 transitions. [2022-11-03 04:20:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:47,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:47,124 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] [2022-11-03 04:20:47,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-03 04:20:47,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:47,337 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-03 04:20:47,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1364029313, now seen corresponding path program 17 times [2022-11-03 04:20:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:47,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715538286] [2022-11-03 04:20:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:47,466 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-03 04:20:47,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:47,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715538286] [2022-11-03 04:20:47,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715538286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:47,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134602100] [2022-11-03 04:20:47,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:20:47,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:47,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:47,468 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:47,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 04:20:47,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:20:47,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:20:47,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:20:47,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:20:47,776 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-03 04:20:47,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:20:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:20:47,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134602100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:47,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [319775539] [2022-11-03 04:20:47,867 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-03 04:20:47,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:47,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-11-03 04:20:47,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906025899] [2022-11-03 04:20:47,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:47,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 04:20:47,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:47,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 04:20:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:20:47,869 INFO L87 Difference]: Start difference. First operand 599 states and 2037 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 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-03 04:20:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:48,307 INFO L93 Difference]: Finished difference Result 1067 states and 3518 transitions. [2022-11-03 04:20:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:20:48,308 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 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 25 [2022-11-03 04:20:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:48,311 INFO L225 Difference]: With dead ends: 1067 [2022-11-03 04:20:48,311 INFO L226 Difference]: Without dead ends: 1067 [2022-11-03 04:20:48,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2022-11-03 04:20:48,312 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 163 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:48,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 61 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:20:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-03 04:20:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 648. [2022-11-03 04:20:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 3.3894899536321486) internal successors, (2193), 647 states have internal predecessors, (2193), 0 states have call successors, (0), 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-03 04:20:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 2193 transitions. [2022-11-03 04:20:48,336 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 2193 transitions. Word has length 25 [2022-11-03 04:20:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:48,337 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 2193 transitions. [2022-11-03 04:20:48,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 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-03 04:20:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 2193 transitions. [2022-11-03 04:20:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:48,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:48,339 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] [2022-11-03 04:20:48,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-03 04:20:48,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:48,545 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-03 04:20:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash -412614537, now seen corresponding path program 18 times [2022-11-03 04:20:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:48,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255766785] [2022-11-03 04:20:48,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:48,688 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-03 04:20:48,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255766785] [2022-11-03 04:20:48,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255766785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304585091] [2022-11-03 04:20:48,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:20:48,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:48,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:48,690 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:48,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 04:20:48,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:20:48,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:20:48,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:20:48,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:20:48,958 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-03 04:20:48,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:20:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:20:49,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304585091] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:49,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [577582361] [2022-11-03 04:20:49,061 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-03 04:20:49,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:49,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-11-03 04:20:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108293186] [2022-11-03 04:20:49,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:49,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:20:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:49,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:20:49,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-11-03 04:20:49,062 INFO L87 Difference]: Start difference. First operand 648 states and 2193 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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-03 04:20:49,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:49,617 INFO L93 Difference]: Finished difference Result 1216 states and 4034 transitions. [2022-11-03 04:20:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:20:49,618 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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-03 04:20:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:49,622 INFO L225 Difference]: With dead ends: 1216 [2022-11-03 04:20:49,622 INFO L226 Difference]: Without dead ends: 1216 [2022-11-03 04:20:49,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-11-03 04:20:49,623 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 140 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:49,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 68 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:20:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-11-03 04:20:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 649. [2022-11-03 04:20:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 3.4089506172839505) internal successors, (2209), 648 states have internal predecessors, (2209), 0 states have call successors, (0), 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-03 04:20:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 2209 transitions. [2022-11-03 04:20:49,646 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 2209 transitions. Word has length 25 [2022-11-03 04:20:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:49,647 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 2209 transitions. [2022-11-03 04:20:49,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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-03 04:20:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 2209 transitions. [2022-11-03 04:20:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:49,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:49,650 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] [2022-11-03 04:20:49,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 04:20:49,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:49,865 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-03 04:20:49,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash -402111433, now seen corresponding path program 19 times [2022-11-03 04:20:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:49,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015431872] [2022-11-03 04:20:49,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:49,995 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-03 04:20:49,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:49,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015431872] [2022-11-03 04:20:49,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015431872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:49,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891728303] [2022-11-03 04:20:49,996 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:20:49,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:49,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:49,997 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:50,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 04:20:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:50,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:20:50,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:20:50,280 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-03 04:20:50,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:20:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:20:50,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891728303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:50,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1110821719] [2022-11-03 04:20:50,393 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-03 04:20:50,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:50,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-11-03 04:20:50,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415737132] [2022-11-03 04:20:50,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:50,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 04:20:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:50,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 04:20:50,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-11-03 04:20:50,395 INFO L87 Difference]: Start difference. First operand 649 states and 2209 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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-03 04:20:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:51,184 INFO L93 Difference]: Finished difference Result 1359 states and 4546 transitions. [2022-11-03 04:20:51,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:20:51,185 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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 25 [2022-11-03 04:20:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:51,189 INFO L225 Difference]: With dead ends: 1359 [2022-11-03 04:20:51,189 INFO L226 Difference]: Without dead ends: 1359 [2022-11-03 04:20:51,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=891, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 04:20:51,190 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 270 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:51,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 66 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:20:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-11-03 04:20:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 661. [2022-11-03 04:20:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 3.4454545454545453) internal successors, (2274), 660 states have internal predecessors, (2274), 0 states have call successors, (0), 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-03 04:20:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 2274 transitions. [2022-11-03 04:20:51,214 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 2274 transitions. Word has length 25 [2022-11-03 04:20:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:51,214 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 2274 transitions. [2022-11-03 04:20:51,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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-03 04:20:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 2274 transitions. [2022-11-03 04:20:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:51,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:51,218 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] [2022-11-03 04:20:51,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 04:20:51,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 04:20:51,445 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-03 04:20:51,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1435379799, now seen corresponding path program 20 times [2022-11-03 04:20:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:51,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032268593] [2022-11-03 04:20:51,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:51,596 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-03 04:20:51,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:51,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032268593] [2022-11-03 04:20:51,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032268593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:51,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207822712] [2022-11-03 04:20:51,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:20:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:51,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:51,599 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:51,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 04:20:51,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:20:51,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:20:51,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:20:51,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:20:51,879 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-03 04:20:51,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:20:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:20:52,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207822712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:52,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [465606689] [2022-11-03 04:20:52,006 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-03 04:20:52,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:52,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-11-03 04:20:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633217393] [2022-11-03 04:20:52,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:52,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:20:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:20:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-11-03 04:20:52,008 INFO L87 Difference]: Start difference. First operand 661 states and 2274 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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-03 04:20:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:52,693 INFO L93 Difference]: Finished difference Result 1143 states and 3830 transitions. [2022-11-03 04:20:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:20:52,694 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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-03 04:20:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:52,698 INFO L225 Difference]: With dead ends: 1143 [2022-11-03 04:20:52,698 INFO L226 Difference]: Without dead ends: 1143 [2022-11-03 04:20:52,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 04:20:52,699 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 247 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:52,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 65 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:20:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-11-03 04:20:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 651. [2022-11-03 04:20:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 3.4123076923076923) internal successors, (2218), 650 states have internal predecessors, (2218), 0 states have call successors, (0), 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-03 04:20:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 2218 transitions. [2022-11-03 04:20:52,720 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 2218 transitions. Word has length 25 [2022-11-03 04:20:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:52,721 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 2218 transitions. [2022-11-03 04:20:52,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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-03 04:20:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 2218 transitions. [2022-11-03 04:20:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:52,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:52,723 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] [2022-11-03 04:20:52,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 04:20:52,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 04:20:52,936 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-03 04:20:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash -223706303, now seen corresponding path program 21 times [2022-11-03 04:20:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:52,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409855138] [2022-11-03 04:20:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:53,062 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-03 04:20:53,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:53,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409855138] [2022-11-03 04:20:53,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409855138] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:53,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30153723] [2022-11-03 04:20:53,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:20:53,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:53,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:53,064 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:53,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 04:20:53,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:20:53,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:20:53,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:20:53,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:20:53,338 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-03 04:20:53,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:20:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:20:53,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30153723] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [706602149] [2022-11-03 04:20:53,478 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-03 04:20:53,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:53,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-11-03 04:20:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425500254] [2022-11-03 04:20:53,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:53,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 04:20:53,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:53,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 04:20:53,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-11-03 04:20:53,480 INFO L87 Difference]: Start difference. First operand 651 states and 2218 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 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-03 04:20:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:54,491 INFO L93 Difference]: Finished difference Result 1461 states and 4877 transitions. [2022-11-03 04:20:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 04:20:54,491 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 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-03 04:20:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:54,495 INFO L225 Difference]: With dead ends: 1461 [2022-11-03 04:20:54,495 INFO L226 Difference]: Without dead ends: 1461 [2022-11-03 04:20:54,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=508, Invalid=1132, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 04:20:54,496 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 419 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:54,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 72 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:20:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-11-03 04:20:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 693. [2022-11-03 04:20:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 3.48121387283237) internal successors, (2409), 692 states have internal predecessors, (2409), 0 states have call successors, (0), 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-03 04:20:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 2409 transitions. [2022-11-03 04:20:54,522 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 2409 transitions. Word has length 25 [2022-11-03 04:20:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:54,522 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 2409 transitions. [2022-11-03 04:20:54,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 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-03 04:20:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 2409 transitions. [2022-11-03 04:20:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:54,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:54,525 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] [2022-11-03 04:20:54,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 04:20:54,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:54,753 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-03 04:20:54,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1613784929, now seen corresponding path program 22 times [2022-11-03 04:20:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:54,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190212679] [2022-11-03 04:20:54,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:54,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:54,878 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-03 04:20:54,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:54,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190212679] [2022-11-03 04:20:54,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190212679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:54,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012959980] [2022-11-03 04:20:54,878 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:20:54,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:54,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:54,880 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:54,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 04:20:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:55,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:20:55,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:20:55,143 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-03 04:20:55,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:20:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:20:55,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012959980] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:55,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1020821788] [2022-11-03 04:20:55,268 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-03 04:20:55,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:55,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-03 04:20:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236110339] [2022-11-03 04:20:55,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:55,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 04:20:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 04:20:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-11-03 04:20:55,271 INFO L87 Difference]: Start difference. First operand 693 states and 2409 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 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-03 04:20:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:56,333 INFO L93 Difference]: Finished difference Result 1413 states and 4686 transitions. [2022-11-03 04:20:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 04:20:56,334 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 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-03 04:20:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:56,339 INFO L225 Difference]: With dead ends: 1413 [2022-11-03 04:20:56,339 INFO L226 Difference]: Without dead ends: 1413 [2022-11-03 04:20:56,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=522, Invalid=1284, Unknown=0, NotChecked=0, Total=1806 [2022-11-03 04:20:56,340 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 379 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:56,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 78 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:20:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2022-11-03 04:20:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 677. [2022-11-03 04:20:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 3.43491124260355) internal successors, (2322), 676 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-03 04:20:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2322 transitions. [2022-11-03 04:20:56,366 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2322 transitions. Word has length 25 [2022-11-03 04:20:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:56,366 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 2322 transitions. [2022-11-03 04:20:56,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 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-03 04:20:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2322 transitions. [2022-11-03 04:20:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:56,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:56,369 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] [2022-11-03 04:20:56,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 04:20:56,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 04:20:56,592 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-03 04:20:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash -859354721, now seen corresponding path program 23 times [2022-11-03 04:20:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:56,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10447759] [2022-11-03 04:20:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:56,718 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-03 04:20:56,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:56,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10447759] [2022-11-03 04:20:56,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10447759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:56,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479945471] [2022-11-03 04:20:56,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:20:56,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:56,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:56,720 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:56,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 04:20:56,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:20:56,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:20:56,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:20:56,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:20:57,015 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-03 04:20:57,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:20:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:20:57,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479945471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:57,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [190196505] [2022-11-03 04:20:57,127 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-03 04:20:57,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:57,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-11-03 04:20:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133999527] [2022-11-03 04:20:57,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:57,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:20:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:20:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-11-03 04:20:57,131 INFO L87 Difference]: Start difference. First operand 677 states and 2322 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 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-03 04:20:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:57,667 INFO L93 Difference]: Finished difference Result 1037 states and 3447 transitions. [2022-11-03 04:20:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:20:57,667 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 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-03 04:20:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:57,670 INFO L225 Difference]: With dead ends: 1037 [2022-11-03 04:20:57,670 INFO L226 Difference]: Without dead ends: 1037 [2022-11-03 04:20:57,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=629, Unknown=0, NotChecked=0, Total=870 [2022-11-03 04:20:57,671 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 161 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:57,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 62 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:20:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-11-03 04:20:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 677. [2022-11-03 04:20:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 3.421597633136095) internal successors, (2313), 676 states have internal predecessors, (2313), 0 states have call successors, (0), 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-03 04:20:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2313 transitions. [2022-11-03 04:20:57,688 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2313 transitions. Word has length 25 [2022-11-03 04:20:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:57,688 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 2313 transitions. [2022-11-03 04:20:57,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 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-03 04:20:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2313 transitions. [2022-11-03 04:20:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:57,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:57,690 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] [2022-11-03 04:20:57,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 04:20:57,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 04:20:57,909 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-03 04:20:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1112439943, now seen corresponding path program 24 times [2022-11-03 04:20:57,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:57,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451828083] [2022-11-03 04:20:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:57,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:58,090 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-03 04:20:58,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451828083] [2022-11-03 04:20:58,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451828083] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:58,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140528261] [2022-11-03 04:20:58,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:20:58,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:58,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:58,095 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:58,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 04:20:58,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:20:58,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:20:58,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:20:58,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:20:58,433 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-03 04:20:58,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:20:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:20:58,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140528261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:20:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [318276688] [2022-11-03 04:20:58,569 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-03 04:20:58,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:20:58,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-11-03 04:20:58,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684747871] [2022-11-03 04:20:58,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:20:58,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:20:58,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:20:58,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:20:58,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-11-03 04:20:58,570 INFO L87 Difference]: Start difference. First operand 677 states and 2313 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 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-03 04:20:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:20:59,303 INFO L93 Difference]: Finished difference Result 1061 states and 3537 transitions. [2022-11-03 04:20:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:20:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 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-03 04:20:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:20:59,308 INFO L225 Difference]: With dead ends: 1061 [2022-11-03 04:20:59,308 INFO L226 Difference]: Without dead ends: 1061 [2022-11-03 04:20:59,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-11-03 04:20:59,309 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 163 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:20:59,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 74 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:20:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-11-03 04:20:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 661. [2022-11-03 04:20:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 3.4075757575757577) internal successors, (2249), 660 states have internal predecessors, (2249), 0 states have call successors, (0), 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-03 04:20:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 2249 transitions. [2022-11-03 04:20:59,339 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 2249 transitions. Word has length 25 [2022-11-03 04:20:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:20:59,339 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 2249 transitions. [2022-11-03 04:20:59,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 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-03 04:20:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 2249 transitions. [2022-11-03 04:20:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:20:59,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:20:59,342 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] [2022-11-03 04:20:59,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-03 04:20:59,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:59,568 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 04:20:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:20:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 256376865, now seen corresponding path program 25 times [2022-11-03 04:20:59,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:20:59,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126127463] [2022-11-03 04:20:59,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:20:59,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:20:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:20:59,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:20:59,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126127463] [2022-11-03 04:20:59,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126127463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:20:59,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872920930] [2022-11-03 04:20:59,721 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:20:59,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:20:59,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:20:59,722 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:20:59,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 04:20:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:20:59,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 04:20:59,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:21:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:21:00,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:21:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:21:00,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872920930] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:21:00,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [851454186] [2022-11-03 04:21:00,092 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-03 04:21:00,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:21:00,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-11-03 04:21:00,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127728261] [2022-11-03 04:21:00,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:21:00,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 04:21:00,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:21:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 04:21:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-03 04:21:00,094 INFO L87 Difference]: Start difference. First operand 661 states and 2249 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:21:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:21:00,479 INFO L93 Difference]: Finished difference Result 881 states and 2784 transitions. [2022-11-03 04:21:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:21:00,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 04:21:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:21:00,482 INFO L225 Difference]: With dead ends: 881 [2022-11-03 04:21:00,482 INFO L226 Difference]: Without dead ends: 849 [2022-11-03 04:21:00,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-03 04:21:00,483 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 125 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:21:00,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 54 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:21:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-11-03 04:21:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 706. [2022-11-03 04:21:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 3.2453900709219856) internal successors, (2288), 705 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:21:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2288 transitions. [2022-11-03 04:21:00,499 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2288 transitions. Word has length 25 [2022-11-03 04:21:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:21:00,499 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 2288 transitions. [2022-11-03 04:21:00,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:21:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2288 transitions. [2022-11-03 04:21:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:21:00,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:21:00,501 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] [2022-11-03 04:21:00,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 04:21:00,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 04:21:00,725 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 04:21:00,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:21:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash 315203941, now seen corresponding path program 26 times [2022-11-03 04:21:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:21:00,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103507560] [2022-11-03 04:21:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:21:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:21:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:21:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:21:00,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:21:00,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103507560] [2022-11-03 04:21:00,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103507560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:21:00,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615111263] [2022-11-03 04:21:00,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:21:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:00,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:21:00,887 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:21:00,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 04:21:01,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:21:01,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:21:01,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 04:21:01,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:21:01,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 35 [2022-11-03 04:21:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:21:01,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:21:01,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 43 [2022-11-03 04:21:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:21:01,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615111263] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:21:01,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068450377] [2022-11-03 04:21:01,463 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-03 04:21:01,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:21:01,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-11-03 04:21:01,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554101833] [2022-11-03 04:21:01,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:21:01,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:21:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:21:01,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:21:01,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-03 04:21:01,466 INFO L87 Difference]: Start difference. First operand 706 states and 2288 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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-03 04:21:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:21:02,669 INFO L93 Difference]: Finished difference Result 1168 states and 3684 transitions. [2022-11-03 04:21:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 04:21:02,669 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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-03 04:21:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:21:02,675 INFO L225 Difference]: With dead ends: 1168 [2022-11-03 04:21:02,675 INFO L226 Difference]: Without dead ends: 1168 [2022-11-03 04:21:02,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=1331, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 04:21:02,676 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 274 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:21:02,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 115 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 04:21:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-11-03 04:21:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 830. [2022-11-03 04:21:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 3.273823884197829) internal successors, (2714), 829 states have internal predecessors, (2714), 0 states have call successors, (0), 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-03 04:21:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2714 transitions. [2022-11-03 04:21:02,703 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2714 transitions. Word has length 26 [2022-11-03 04:21:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:21:02,704 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 2714 transitions. [2022-11-03 04:21:02,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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-03 04:21:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2714 transitions. [2022-11-03 04:21:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:21:02,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:21:02,707 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] [2022-11-03 04:21:02,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 04:21:02,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 04:21:02,932 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 04:21:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:21:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash 258541955, now seen corresponding path program 27 times [2022-11-03 04:21:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:21:02,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27803112] [2022-11-03 04:21:02,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:21:02,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:21:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:21:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:21:03,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:21:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27803112] [2022-11-03 04:21:03,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27803112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:21:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332576743] [2022-11-03 04:21:03,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:21:03,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:03,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:21:03,060 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:21:03,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 04:21:03,232 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:21:03,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:21:03,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:21:03,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:21:03,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 35 [2022-11-03 04:21:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:21:03,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:21:03,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 43 [2022-11-03 04:21:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:21:03,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332576743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:21:03,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1565809453] [2022-11-03 04:21:03,374 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-03 04:21:03,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:21:03,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-03 04:21:03,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059466783] [2022-11-03 04:21:03,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:21:03,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 04:21:03,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:21:03,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 04:21:03,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-03 04:21:03,376 INFO L87 Difference]: Start difference. First operand 830 states and 2714 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 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-03 04:21:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:21:03,569 INFO L93 Difference]: Finished difference Result 852 states and 2662 transitions. [2022-11-03 04:21:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:21:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 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 26 [2022-11-03 04:21:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:21:03,571 INFO L225 Difference]: With dead ends: 852 [2022-11-03 04:21:03,571 INFO L226 Difference]: Without dead ends: 812 [2022-11-03 04:21:03,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-11-03 04:21:03,572 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 134 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:21:03,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 33 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:21:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-03 04:21:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 788. [2022-11-03 04:21:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 3.1829733163913594) internal successors, (2505), 787 states have internal predecessors, (2505), 0 states have call successors, (0), 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-03 04:21:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2505 transitions. [2022-11-03 04:21:03,588 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 2505 transitions. Word has length 26 [2022-11-03 04:21:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:21:03,589 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 2505 transitions. [2022-11-03 04:21:03,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 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-03 04:21:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 2505 transitions. [2022-11-03 04:21:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:21:03,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:21:03,591 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, 1] [2022-11-03 04:21:03,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-03 04:21:03,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:03,804 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 04:21:03,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:21:03,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1785027928, now seen corresponding path program 1 times [2022-11-03 04:21:03,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:21:03,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820591653] [2022-11-03 04:21:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:21:03,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:21:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:21:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:21:03,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:21:03,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820591653] [2022-11-03 04:21:03,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820591653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:21:03,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132033579] [2022-11-03 04:21:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:21:03,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:03,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:21:03,951 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:21:03,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 04:21:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:21:04,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:21:04,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:21:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:21:04,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:21:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:21:04,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132033579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:21:04,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1473782328] [2022-11-03 04:21:04,290 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-03 04:21:04,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:21:04,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-11-03 04:21:04,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827368961] [2022-11-03 04:21:04,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:21:04,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 04:21:04,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:21:04,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 04:21:04,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-03 04:21:04,292 INFO L87 Difference]: Start difference. First operand 788 states and 2505 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 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-03 04:21:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:21:04,855 INFO L93 Difference]: Finished difference Result 920 states and 2826 transitions. [2022-11-03 04:21:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:21:04,855 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 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-03 04:21:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:21:04,857 INFO L225 Difference]: With dead ends: 920 [2022-11-03 04:21:04,857 INFO L226 Difference]: Without dead ends: 780 [2022-11-03 04:21:04,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2022-11-03 04:21:04,858 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 199 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:21:04,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 79 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:21:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-03 04:21:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 720. [2022-11-03 04:21:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 3.168289290681502) internal successors, (2278), 719 states have internal predecessors, (2278), 0 states have call successors, (0), 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-03 04:21:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2278 transitions. [2022-11-03 04:21:04,872 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 2278 transitions. Word has length 26 [2022-11-03 04:21:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:21:04,872 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 2278 transitions. [2022-11-03 04:21:04,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 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-03 04:21:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 2278 transitions. [2022-11-03 04:21:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:21:04,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:21:04,874 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, 1] [2022-11-03 04:21:04,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 04:21:05,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:05,080 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 04:21:05,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:21:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1332685094, now seen corresponding path program 2 times [2022-11-03 04:21:05,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:21:05,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871687316] [2022-11-03 04:21:05,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:21:05,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:21:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:21:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:21:05,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:21:05,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871687316] [2022-11-03 04:21:05,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871687316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:21:05,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058032504] [2022-11-03 04:21:05,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:21:05,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:05,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:21:05,206 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:21:05,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 04:21:05,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:21:05,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:21:05,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 04:21:05,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:21:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:21:05,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:21:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:21:05,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058032504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:21:05,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [753729372] [2022-11-03 04:21:05,610 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-03 04:21:05,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:21:05,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-11-03 04:21:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716428498] [2022-11-03 04:21:05,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:21:05,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 04:21:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:21:05,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 04:21:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-03 04:21:05,612 INFO L87 Difference]: Start difference. First operand 720 states and 2278 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 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-03 04:21:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:21:05,891 INFO L93 Difference]: Finished difference Result 664 states and 2023 transitions. [2022-11-03 04:21:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:21:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 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 26 [2022-11-03 04:21:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:21:05,893 INFO L225 Difference]: With dead ends: 664 [2022-11-03 04:21:05,893 INFO L226 Difference]: Without dead ends: 501 [2022-11-03 04:21:05,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:21:05,894 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 116 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:21:05,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 33 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:21:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-11-03 04:21:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-11-03 04:21:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 3.296) internal successors, (1648), 500 states have internal predecessors, (1648), 0 states have call successors, (0), 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-03 04:21:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1648 transitions. [2022-11-03 04:21:05,906 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1648 transitions. Word has length 26 [2022-11-03 04:21:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:21:05,907 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 1648 transitions. [2022-11-03 04:21:05,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 15 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-03 04:21:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1648 transitions. [2022-11-03 04:21:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 04:21:05,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:21:05,908 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:21:05,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 04:21:06,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:06,124 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 04:21:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:21:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash 881409425, now seen corresponding path program 28 times [2022-11-03 04:21:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:21:06,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229847267] [2022-11-03 04:21:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:21:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:21:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:21:08,781 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-03 04:21:08,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:21:08,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229847267] [2022-11-03 04:21:08,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229847267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:21:08,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758747520] [2022-11-03 04:21:08,782 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:21:08,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:21:08,784 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:21:08,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-03 04:21:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:21:08,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-03 04:21:08,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:21:10,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:21:10,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 175 treesize of output 141 [2022-11-03 04:21:10,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:21:10,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:10,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 254 treesize of output 152 [2022-11-03 04:21:12,137 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-03 04:21:12,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:21:18,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1914 treesize of output 1306 [2022-11-03 04:21:18,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1240 treesize of output 1208 [2022-11-03 04:21:18,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1208 treesize of output 1182 [2022-11-03 04:21:18,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1182 treesize of output 1150 [2022-11-03 04:21:18,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1150 treesize of output 1124 [2022-11-03 04:21:18,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1124 treesize of output 1104 [2022-11-03 04:21:18,378 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1104 treesize of output 1072 [2022-11-03 04:21:18,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1072 treesize of output 1053 [2022-11-03 04:21:18,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1053 treesize of output 1040 [2022-11-03 04:21:18,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1040 treesize of output 1014 [2022-11-03 04:21:18,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1014 treesize of output 988 [2022-11-03 04:21:18,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 988 treesize of output 956 [2022-11-03 04:21:18,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 956 treesize of output 924 [2022-11-03 04:21:18,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 924 treesize of output 904 [2022-11-03 04:21:18,613 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:21:18,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 904 treesize of output 872 [2022-11-03 04:21:19,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:21:19,870 INFO L356 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-11-03 04:21:19,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1017 treesize of output 323 [2022-11-03 04:21:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:21:20,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758747520] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:21:20,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1575131221] [2022-11-03 04:21:20,804 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-03 04:21:20,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:21:20,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2022-11-03 04:21:20,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667360168] [2022-11-03 04:21:20,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:21:20,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 04:21:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:21:20,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 04:21:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2239, Unknown=3, NotChecked=0, Total=2450 [2022-11-03 04:21:20,807 INFO L87 Difference]: Start difference. First operand 501 states and 1648 transitions. Second operand has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 49 states have internal predecessors, (84), 0 states have call successors, (0), 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-03 04:21:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:21:26,019 INFO L93 Difference]: Finished difference Result 750 states and 2342 transitions. [2022-11-03 04:21:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 04:21:26,020 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 49 states have internal predecessors, (84), 0 states have call successors, (0), 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-03 04:21:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:21:26,021 INFO L225 Difference]: With dead ends: 750 [2022-11-03 04:21:26,021 INFO L226 Difference]: Without dead ends: 743 [2022-11-03 04:21:26,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=606, Invalid=4503, Unknown=3, NotChecked=0, Total=5112 [2022-11-03 04:21:26,023 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 323 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:21:26,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 106 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1745 Invalid, 0 Unknown, 524 Unchecked, 1.7s Time] [2022-11-03 04:21:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-03 04:21:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 541. [2022-11-03 04:21:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 3.22962962962963) internal successors, (1744), 540 states have internal predecessors, (1744), 0 states have call successors, (0), 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-03 04:21:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1744 transitions. [2022-11-03 04:21:26,038 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1744 transitions. Word has length 28 [2022-11-03 04:21:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:21:26,038 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 1744 transitions. [2022-11-03 04:21:26,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 49 states have internal predecessors, (84), 0 states have call successors, (0), 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-03 04:21:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1744 transitions. [2022-11-03 04:21:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 04:21:26,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:21:26,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:21:26,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-03 04:21:26,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-03 04:21:26,260 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 04:21:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:21:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1800897809, now seen corresponding path program 29 times [2022-11-03 04:21:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:21:26,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626604113] [2022-11-03 04:21:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:21:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:21:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:21:29,563 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-03 04:21:29,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:21:29,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626604113] [2022-11-03 04:21:29,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626604113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:21:29,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536791933] [2022-11-03 04:21:29,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:21:29,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:21:29,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:21:29,565 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:21:29,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fffff0e-666c-4560-878d-0032656ffc1c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 04:21:29,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:21:29,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:21:29,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-03 04:21:29,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:21:29,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 96 treesize of output 94 [2022-11-03 04:21:30,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 61 [2022-11-03 04:21:33,436 INFO L356 Elim1Store]: treesize reduction 50, result has 90.4 percent of original size [2022-11-03 04:21:33,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 325 treesize of output 639 [2022-11-03 04:21:44,042 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.